skip to content
Interconnection networks and mapping and scheduling parallel computations : DIMACS workshop, February 7-9, 1994 Preview this item
ClosePreview this item
Checking...

Interconnection networks and mapping and scheduling parallel computations : DIMACS workshop, February 7-9, 1994

Author: D Frank Hsu; Arnold L Rosenberg; Dominique Sotteau; NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science.; DIMACS (Group)
Publisher: [Providence, R.I.] : American Mathematical Society, ©1995.
Series: DIMACS series in discrete mathematics and theoretical computer science, v. 21.
Edition/Format:   Book : Conference publication : EnglishView all editions and formats
Database:WorldCat
Summary:

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  Read more...

Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Conference proceedings
Congresses
Material Type: Conference publication
Document Type: Book
All Authors / Contributors: D Frank Hsu; Arnold L Rosenberg; Dominique Sotteau; NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science.; DIMACS (Group)
ISBN: 0821802380 9780821802380
OCLC Number: 32273421
Notes: "Refereed versions of papers from a workshop held at Rutgers University, from February 7-9, 1994"--T.p. verso.
"NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science, a consortium of Rutgers University, Princeton University, AT&T Bell Labs, Bellcore."
Description: x, 342 p. : ill. ; 27 cm.
Contents: 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.
Series Title: DIMACS series in discrete mathematics and theoretical computer science, v. 21.
Responsibility: D. Frank Hsu, Arnold L. Rosenberg, Dominique Sotteau, editors.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/32273421>
library:oclcnum"32273421"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/32273421>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/1052928>
rdf:typeschema:Intangible
schema:name"Parallel processing (Electronic computers)"@en
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:contributor
<http://viaf.org/viaf/160155122>
rdf:typeschema:Organization
schema:name"NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science."
schema:contributor
schema:contributor
schema:copyrightYear"1995"
schema:datePublished"1995"
schema:exampleOfWork<http://worldcat.org/entity/work/id/806343044>
schema:genre"Conference proceedings."@en
schema:genre"Conference proceedings"@en
schema:inLanguage"en"
schema:name"Interconnection networks and mapping and scheduling parallel computations : DIMACS workshop, February 7-9, 1994"@en
schema:numberOfPages"342"
schema:publisher
schema:url
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.