Treffer: Permutations on the block PRAM
Title:
Permutations on the block PRAM
Authors:
Source:
Information processing letters. 45(2):69-73
Publisher Information:
Amsterdam: Elsevier Science, 1993.
Publication Year:
1993
Physical Description:
print, 12 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Communication, Comunicación, Complexité calcul, Computing complexity, Complejidad cálculo, Parallélisme, Parallelism, Paralelismo, Bloc PRAM, Block PRAM, Complexité calcul parallèle, Parallel computational complexity, Latence communication, Communication latency, Routage permutation, Permutation routing
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Texas A&M univ., dep. mathematics, College Station TX 77843, United States
ISSN:
0020-0190
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.4753949
Database:
PASCAL Archive
Weitere Informationen
In present-day parallel computers, the complexity of permuting N data items in shared memory varies, depending on whether large blocks can be used for communication. The Block PRAM model of Aggarwal, Chandra and Snir is unique among shared-memory models of parallel computation in modeling this phenomenon. We characterize the Block PRAM complexity of some useful classes of permutations, improving known results.