 |
|
|
Item Details
| Title:
|
AUTOMATIC PARALLELIZATION
NEW APPROACHES TO CODE GENERATION, DATA DISTRIBUTION AND PERFORMANCE PREDICTION |
| By: |
Christoph W. Kessler (Editor) |
| Format: |
Paperback |
| List price:
|
£99.99 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
3528054018 |
| ISBN 13: |
9783528054014 |
| Publisher: |
FRIEDRICH VIEWEG & SOHN VERLAGSGESELLSCHAFT MBH |
| Pub. date: |
1 January, 1994 |
| Edition: |
1994 ed. |
| Series: |
Vieweg Advanced Studies in Computer Science |
| Pages: |
224 |
| Description: |
Contains 11 contributions which deal with true automatic parallelization, and the focus is on automatic methods. Some of the questions under discussion are: up to which degree is automatic parallelization for DMS possible today? In which cases can knowledge-based methods help? |
| Synopsis: |
Distributed-memory multiprocessing systems (DMS), such as Intel's hypercubes, the Paragon, Thinking Machine's CM-5, and the Meiko Computing Surface, have rapidly gained user acceptance and promise to deliver the computing power required to solve the grand challenge problems of Science and Engineering. These machines are relatively inexpensive to build, and are potentially scalable to large numbers of processors. However, they are difficult to program: the non-uniformity of the memory which makes local accesses much faster than the transfer of non-local data via message-passing operations implies that the locality of algorithms must be exploited in order to achieve acceptable performance. The management of data, with the twin goals of both spreading the computational workload and minimizing the delays caused when a processor has to wait for non-local data, becomes of paramount importance. When a code is parallelized by hand, the programmer must distribute the program's work and data to the processors which will execute it. One of the common approaches to do so makes use of the regularity of most numerical computations.This is the so-called Single Program Multiple Data (SPMD) or data parallel model of computation. With this method, the data arrays in the original program are each distributed to the processors, establishing an ownership relation, and computations defining a data item are performed by the processors owning the data. |
| Illustrations: |
biography |
| Publication: |
Germany |
| Imprint: |
Friedrich Vieweg & Sohn Verlagsgesellschaft mbH |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|