Sciweavers

822 search results - page 50 / 165
» Contention in shared memory algorithms
Sort
View
HPCA
2006
IEEE
14 years 9 months ago
Completely verifying memory consistency of test program executions
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
Chaiyasit Manovit, Sudheendra Hangal
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 9 months ago
Clustering and Sharing Incentives in BitTorrent Systems
Peer-to-peer protocols play an increasingly instrumental role in Internet content distribution. It is therefore important to gain a complete understanding of how these protocols b...
Arnaud Legout, Nikitas Liogkas, Eddie Kohler, Lixi...
COLCOM
2005
IEEE
14 years 2 months ago
Scheduling algorithms for peer-to-peer collaborative file distribution
—Peer-to-Peer file sharing applications in the Internet, such as BitTorrent, Gnutella, etc., have been immensely popular. Prior research mainly focuses on peer and content discov...
Jonathan S. K. Chan, Victor O. K. Li, King-Shan Lu...
CLUSTER
2001
IEEE
14 years 15 days ago
Clusterfile: A Flexible Physical Layout Parallel File System
This paper presents Clusterfile, a parallel file system that provides parallel file access on a cluster of computers. Existing parallel file systems offer little control over matc...
Florin Isaila, Walter F. Tichy
NJC
2000
99views more  NJC 2000»
13 years 8 months ago
An Incremental Unique Representation for Regular Trees
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne