Sciweavers

1497 search results - page 127 / 300
» A Computational Model for Message Passing
Sort
View
IJHPCA
2006
117views more  IJHPCA 2006»
13 years 8 months ago
MPICH-V Project: A Multiprotocol Automatic Fault-Tolerant MPI
Abstract-- High performance computing platforms like Clusters, Grid and Desktop Grids are becoming larger and subject to more frequent failures. MPI is one of the most used message...
Aurelien Bouteiller, Thomas Hérault, G&eacu...
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
14 years 8 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
TAMC
2007
Springer
14 years 2 months ago
Finding a Duplicate and a Missing Item in a Stream
We consider the following problem in a stream model: Given a sequence a = a1, a2, . . . , am wich each ai ∈ [n] = {1, . . . , n} and m > n, find a duplicate in the sequence, ...
Jun Tarui
ICPP
2002
IEEE
14 years 1 months ago
BPA: A Fast Packet Scheduling Algorithm for Real-Time Switched Ethernet Networks
In this paper, we present a MAC-Iayer packet scheduling algorithm called BPA, for real-time switched Ethernet networks. BPA considers a message model where trans-node application-...
Jinggang Wang, Binoy Ravindran
ICDCS
1995
IEEE
13 years 12 months ago
A Distributed K-Mutual Exclusion Algorithm
This paper presents a token-based K-mutual exchsion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token r...
Shailaja Bulgannawar, Nitin H. Vaidya