Sciweavers

2720 search results - page 388 / 544
» Parallel Pairwise Clustering.
Sort
View
IPPS
1998
IEEE
15 years 11 months ago
Fault-Tolerant Message Routing for Multiprocessors
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
Lev Zakrevski, Mark G. Karpovsky
HPDC
1997
IEEE
15 years 11 months ago
Cut-Through Delivery in Trapeze: An Exercise in Low-Latency Messaging
New network technology continues to improve both the latency and bandwidth of communication in computer clusters. The fastest high-speed networks approach or exceed the I/O bus ba...
Ken Yocum, Jeffrey S. Chase, Andrew J. Gallatin, A...
SIGMOD
1997
ACM
135views Database» more  SIGMOD 1997»
15 years 11 months ago
High-Performance Sorting on Networks of Workstations
We report the performance of NOW-Sort, a collection of sorting implementations on a Network of Workstations (NOW). We find that parallel sorting on a NOW is competitive to sortin...
Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau,...
CLUSTER
2009
IEEE
15 years 10 months ago
Analytical modeling and optimization for affinity based thread scheduling on multicore systems
Abstract--This paper proposes an analytical model to estimate the cost of running an affinity-based thread schedule on multicore systems. The model consists of three submodels to e...
Fengguang Song, Shirley Moore, Jack Dongarra
ICDCS
2010
IEEE
15 years 10 months ago
Sifting through Network Data to Cull Activity Patterns with HEAPs
—Today’s large campus and enterprise networks are characterized by their complexity, i.e. containing thousands of hosts, and diversity, i.e. with various applications and usage...
Esam Sharafuddin, Yu Jin, Nan Jiang, Zhi-Li Zhang