[图书][B] Advanced computer architecture: parallelism, scalability, programmability
Course Syllabus Course Title: Advanced Computer Architecture Page 1 Page 1 of 5
Philadelphia University Faculty of Information Technology Department of Computer Science …
Philadelphia University Faculty of Information Technology Department of Computer Science …
[PDF][PDF] Hypertool: A programming aid for message-passing systems
As both the number of processors and the complexity of problems to be solved increase,
programming multiprocessing systems becomes more di cult and errorprone. This paper …
programming multiprocessing systems becomes more di cult and errorprone. This paper …
Optimum broadcasting and personalized communication in hypercubes
SL Johnsson, CT Ho - IEEE Transactions on computers, 1989 - ieeexplore.ieee.org
Four different communication problems are addressed in Boolean n-cube configured
multiprocessors:(1) one-to-all broadcasting: distribution of common data from a single …
multiprocessors:(1) one-to-all broadcasting: distribution of common data from a single …
A comparative study of topological properties of hypercubes and star graphs
K Day, A Tripathi - IEEE Transactions on Parallel and …, 1994 - ieeexplore.ieee.org
Undertakes a comparative study of two important interconnection network topologies: the
star graph and the hypercube, from the graph theory point of view. Topological properties …
star graph and the hypercube, from the graph theory point of view. Topological properties …
Multicast communication in multicomputer networks
X Lin, LM Ni - IEEE transactions on Parallel and Distributed …, 1993 - ieeexplore.ieee.org
Efficient routing of messages is a key to the performance of multicomputers. Multicast
communication refers to the delivery of the same message from a source node to an …
communication refers to the delivery of the same message from a source node to an …
Hypernet: A communication-efficient architecture for constructing massively parallel computers
A new class of modular networks is proposed for hierarchically constructing massively
parallel computer systems for distributed supercomputing and AI applications. These …
parallel computer systems for distributed supercomputing and AI applications. These …
Gossiping in minimal time
DW Krumme, G Cybenko, KN Venkataraman - SIAM Journal on Computing, 1992 - SIAM
The gossip problem involves communicating a unique item from each node in a graph to
every other node. This paper studies the minimum time required to do this under the …
every other node. This paper studies the minimum time required to do this under the …
Efficient parallel convex hull algorithms
Parallel algorithms are presented to identify (ie detect and enumerate) the extreme points of
the convex hull of a set of planar points using a hypercube, pyramid, tree, mesh-of-trees …
the convex hull of a set of planar points using a hypercube, pyramid, tree, mesh-of-trees …
Intensive hypercube communication prearranged communication in link-bound machines
QF Stout, B Wagar - Journal of Parallel and Distributed Computing, 1990 - Elsevier
Hypercube algorithms are developed for a variety of communication-intensive tasks such as
transposing a matrix, histogramming, sending a (long) message from one node to another …
transposing a matrix, histogramming, sending a (long) message from one node to another …
[图书][B] The impact of vector and parallel architectures on the Gaussian elimination algorithm
Y Robert - 1990 - books.google.com
Page 1 ALGORITHMS AND ARCHITECTURES FOR ADVANCED SCIENTIFIC
COMPUTING THE IMPACT OF VECTOR AND PARALLEL ARCHITECTURES ON THE …
COMPUTING THE IMPACT OF VECTOR AND PARALLEL ARCHITECTURES ON THE …