 |
|
|
Item Details
| Title:
|
INTERCONNECTION NETWORKS AND MAPPING AND SCHEDULING PARALLEL COMPUTATIONS
|
| By: |
D. Frank Hsu (Editor), Arnold L. Rosenberg (Editor), Dominique Sotteau (Editor) |
| Format: |
Hardback |
| List price:
|
£94.50 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
0821802380 |
| ISBN 13: |
9780821802380 |
| Publisher: |
AMERICAN MATHEMATICAL SOCIETY |
| Pub. date: |
1 January, 1995 |
| Series: |
Series in Discrete Mathematics & Theoretical Computer Science No. 21 |
| Pages: |
342 |
| Description: |
The interconnection network is one of the most basic components of a massively parallel computer system. Such systems consist of hundreds or thousands of processors interconnected to work cooperatively on computations. This book contains the proceedings of a DIMACS Workshop on Massively Parallel Computation, held in February 1994. |
| Synopsis: |
The interconnection network is one of the most basic components of a massively parallel computer system. Such systems consist of hundreds or thousands of processors interconnected to work cooperatively on computations. One of the central problems in parallel computing is the task of mapping a collection of processes onto the processors and routing network of a parallel machine. Once this mapping is done, it is critical to schedule computations within and communication among processors so that the necessary inputs for a process are available where and when the process is scheduled to be computed.This book contains the refereed proceedings of a DIMACS Workshop on Massively Parallel Computation, held in February 1994. The workshop brought together researchers from universities and laboratories, as well as practitioners involved in the design, implementation, and application of massively parallel systems. Focusing on interconnection networks of parallel architectures of today and of the near future, the book includes topics such as network topologies, network properties, message routing, network embeddings, network emulation, mappings, and efficient scheduling. |
| Illustrations: |
Illustrations |
| Publication: |
US |
| Imprint: |
American Mathematical Society |
| 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.
|
|
|
|