Interconnection Networks and Mapping and Scheduling Parallel Computations

Inbunden, Engelska, 1995

Del i serien DIMACS: Series in Discrete Mathematics and Theoretical Computer Science

1 439 kr

Beställningsvara. Skickas inom 11-20 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:1995-07-30
Vikt:822 g
Format:Inbunden
Språk:Engelska
Serie:DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
Förlag:American Mathematical Society
ISBN:9780821802380

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

Ranking algorithms for Hamiltonian paths in hypercubic networks by F. S. Annexstein Dense bus networks of diameter $2$ by J.-C. Bermond, J. Bond, and S. Djelloul On broadcasting schemes in restricted optical passive star systems by P. Berthome and A. Ferreira Restricted routing and wide diameter of the cycle prefix network by W. Y. C. Chen, V. Faber, and E. Knill Permutation routing via Cayley graphs with an example for bus interconnection networks by G. Cooperman and L. Finkelstein Using helpful sets to improve graph bisections by R. Diekmann, B. Monien, and R. Preis Modification of consecutive-$d$ digraphs by D.-Z. Du, D. F. Hsu, and D. J. Kleitman Highly adaptive wormhole routing algorithms for $N$-dimensional torus by J. Duato and P. Lopez Conflict-free access to constant-perimeter rectangular subarrays by D. G. Erickson and C. J. Colboum Makespan minimization of task graphs with random task running times by L. Finta and Z. Liu Scheduling of structured and unstructured computation by A. Gerasoulis, J. Jiao, and T. Yang Routing in optical networks: The problem of contention by L. A. Goldberg Communications in optically interconnected parallel computer systems by M. Hamdi Fault-tolerant Kautz networks by R. Harbane Asynchronous packet routers by C. Jesshope and I. Nedelchev Cayley digraphs of finite cyclic groups with minimal average distance by X. Jia Shuffled tree based fault-tolerant hierarchical interconnection networks by O. H. Karam and D. P. Agrawal Restricted connectivity and restricted fault diameter of some interconnection networks by L. Qiao and Z. Yi Sorting and selection on interconnection networks by S. Rajasekaran Towards a simple construction method for Hamiltonian decomposition of the hypercube by S. W. Song Generalized reduced hypercube interconnection networks for massively parallel computers by S. G. Ziavras.

Mer från samma författare

Equivariant Homotopy and Cohomology Theory

American Mathematical Society

Häftad, 1996

758 kr

Introduction to Morse Theory

American Mathematical Society

Häftad, 2001

633 kr

Algebraic Geometry 1, Volume 1

American Mathematical Society

Häftad, 1999

633 kr

Geometry of Conics

American Mathematical Society

Häftad, 2007

591 kr

A. Adrian Albert Collected Mathematical Papers, Volume 3, Parts 1 & 2

American Mathematical Society

Inbunden, 1993

3 553 kr

Collected Works of Witold Hurewicz

American Mathematical Society

Inbunden, 1995

3 056 kr

John Von Neumann, 1903-1957

American Mathematical Society

Häftad, 1966

753 kr

Modern Statistics

American Mathematical Society

Häftad, 1980

1 495 kr

Game Theory and Its Applications

American Mathematical Society

Häftad, 1981

1 495 kr

Operations Research Mathematics and Models

American Mathematical Society

Häftad, 1981

1 495 kr

Mer från samma serie

Parallel Processing of Discrete Optimization Problems

American Mathematical Society

Inbunden, 1995

1 537 kr

Specification of Parallel Algorithms

American Mathematical Society

Inbunden, 1994

1 370 kr

Formal Power Series and Algebraic Combinatorics

American Mathematical Society

Inbunden, 1995

786 kr

Parallel Algorithms

Sandeep N. Bhatt

Inbunden, 1997

786 kr

Geometric and Computational Perspectives on Infinite Groups

Gilbert Baumslag, David Epstein, Robert Gilman, Hamish Short, Charles Sims

Inbunden, 1995

1 008 kr

Global Minimization of Nonconvex Energy Functions

American Mathematical Society

Inbunden, 1995

1 120 kr

Satisfiability Problem

Ding-Zhu Du, Jun Gu, P. M. Pardalos

Inbunden, 1997

2 552 kr

Groups and Computation II

Larry A. Finkelstein, W.M. Kantor

Inbunden, 1997

1 370 kr

Descriptive Complexity and Finite Models

Neil Immerman, Phokion G. Kolaitis

Inbunden, 1997

967 kr

Proof Complexity and Feasible Arithmetics

Paul W. Beame, Samuel R. Buss

Inbunden, 1997

1 008 kr

Du kanske också är intresserad av

Signerad!

SIGNERAD - Om julens wälgång

Klara Peters Bastin

Inbunden, 2026

249 kr

Nyhet

Del 11

Medusa

Lars Kepler

Inbunden, 2026

269 kr

Ruth Kvarnström-Jones - SIGNERAD - Systrarna på Sophiahemmet, Inbunden

Signerad!

Del 3

SIGNERAD - Systrarna på Sophiahemmet

Ruth Kvarnström-Jones

Inbunden, 2026

249 kr

Nätmobbning : handbok för skolan

Ann Frisén, Sofia Berne

Häftad, 2016

(3)

329 kr

Nyhet

Det läkande köket

Cecilia Nilsson

Inbunden, 2026

259 kr

Ungdomar och identitet

Ann Frisén, Philip Hwang

Häftad, 2020

391 kr

Karin Smirnoff - Kvinnor som hatar män, Inbunden

Nyhet

Del 9

Kvinnor som hatar män

Karin Smirnoff

Inbunden, 2026

279 kr

-19%

Stortaxi

Flora Wiström

Inbunden, 2026

(3)

209 kr259 kr

Nyhet

Svanesång : min syster Diana

Charles Spencer

Inbunden, 2026

269 kr

-30%

Se dig inte om

Harlan Coben

Pocket, 2026

(1)

69 kr99 kr

Interconnection Networks and Mapping and Scheduling Parallel Computations

AvAmerican Mathematical Society

Inbunden, Engelska, 1995

Del i serien DIMACS: Series in Discrete Mathematics and Theoretical Computer Science

1 439 kr

Beställningsvara. Skickas inom 11-20 vardagar. Fri frakt över 249 kr.

Beskrivning

Produktinformation

Utgivningsdatum:1995-07-30
Vikt:822 g
Format:Inbunden
Språk:Engelska
Serie:DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
Förlag:American Mathematical Society
ISBN:9780821802380

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

Ranking algorithms for Hamiltonian paths in hypercubic networks by F. S. Annexstein Dense bus networks of diameter $2$ by J.-C. Bermond, J. Bond, and S. Djelloul On broadcasting schemes in restricted optical passive star systems by P. Berthome and A. Ferreira Restricted routing and wide diameter of the cycle prefix network by W. Y. C. Chen, V. Faber, and E. Knill Permutation routing via Cayley graphs with an example for bus interconnection networks by G. Cooperman and L. Finkelstein Using helpful sets to improve graph bisections by R. Diekmann, B. Monien, and R. Preis Modification of consecutive-$d$ digraphs by D.-Z. Du, D. F. Hsu, and D. J. Kleitman Highly adaptive wormhole routing algorithms for $N$-dimensional torus by J. Duato and P. Lopez Conflict-free access to constant-perimeter rectangular subarrays by D. G. Erickson and C. J. Colboum Makespan minimization of task graphs with random task running times by L. Finta and Z. Liu Scheduling of structured and unstructured computation by A. Gerasoulis, J. Jiao, and T. Yang Routing in optical networks: The problem of contention by L. A. Goldberg Communications in optically interconnected parallel computer systems by M. Hamdi Fault-tolerant Kautz networks by R. Harbane Asynchronous packet routers by C. Jesshope and I. Nedelchev Cayley digraphs of finite cyclic groups with minimal average distance by X. Jia Shuffled tree based fault-tolerant hierarchical interconnection networks by O. H. Karam and D. P. Agrawal Restricted connectivity and restricted fault diameter of some interconnection networks by L. Qiao and Z. Yi Sorting and selection on interconnection networks by S. Rajasekaran Towards a simple construction method for Hamiltonian decomposition of the hypercube by S. W. Song Generalized reduced hypercube interconnection networks for massively parallel computers by S. G. Ziavras.