Programming Environments for Massively Parallel Distributed Systems
Mathematics of Computing -- Parallelism.... sub- algorithms are to be grouped, then there already are over 6000 ways one could group the sub-algorithms together. ... be O(m x p), For large n it is likely that limn^oo ra x p = m, making this an 0(m) technique. Once the configuration has been generated, the user can examine how well the algorithm parallelised, and if satisfied can expand the pseudo-code until the sub-algorithms are correct C code .
| Title | : | Programming Environments for Massively Parallel Distributed Systems |
| Author | : | Karsten M. Decker, René M. Rehmann |
| Publisher | : | Springer Science & Business Media - 1994-01-01 |
You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.
Once you have finished the sign-up process, you will be redirected to your download Book page.
How it works:- 1. Register a free 1 month Trial Account.
- 2. Download as many books as you like (Personal use)
- 3. Cancel the membership at any time if not satisfied.
