|
⇤ ← Revision 1 as of 2007-02-01 19:11:17
Size: 605
Comment:
|
Size: 619
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| = Parallelization Plans = == For SAGE == |
= Parallelization Plans For SAGE == |
| Line 8: | Line 5: |
| '''Basic Principle''': Parallel methods should 1. Be viewed as a means to an end -- speedups. Never parallelize any computation except to speed up a calculation beyond what can be done using sequential techniques. 2. Should never completely replace sequential implementations. Parallel algorithms are often very complicated to understand and test, so we need to at a ''minimum'' have a randomized test function that compares with that output of purely sequential code. |
== Basic Principles == 1. Parallel methods should always be viewed as a means to an end -- speedups. Never parallelize any computation except to speed up a calculation beyond what can be done using sequential techniques. 2. Parallel methods should never completely replace sequential implementations. Parallel algorithms are often very complicated to understand and test, so we need to at a ''minimum'' have a randomized test function that compares with that output of purely sequential code. |
= Parallelization Plans For SAGE ==
The core SAGE library is a collection of Python and sagex files.
== Basic Principles ==
- Parallel methods should always be viewed as a means to an end -- speedups. Never parallelize any computation except to speed up a calculation beyond what can be done using sequential techniques.
Parallel methods should never completely replace sequential implementations. Parallel algorithms are often very complicated to understand and test, so we need to at a minimum have a randomized test function that compares with that output of purely sequential code.