Sciweavers

63 search results - page 2 / 13
» LoPC: Modeling Contention in Parallel Algorithms
Sort
View
JSSPP
2009
Springer
13 years 12 months ago
Contention-Aware Scheduling with Task Duplication
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interproc...
Oliver Sinnen, Andrea To, Manpreet Kaur
PPAM
2005
Springer
13 years 10 months ago
Total Exchange Performance Modelling Under Network Contention
Abstract. One of the most important collective communication patterns for scientific applications is the many to many, also called complete exchange. Although efficient All-to-All...
Luiz Angelo Steffenel, Grégory Mounié...
MIDDLEWARE
2004
Springer
13 years 10 months ago
A Content Model for Evaluating Peer-to-Peer Searching Techniques
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...
Brian F. Cooper
ICDCS
2005
IEEE
13 years 11 months ago
On Cooperative Content Distribution and the Price of Barter
We study how a server may disseminate a large volume of data to a set of clients in the shortest possible time. We first consider a cooperative scenario where clients are willing...
Prasanna Ganesan, Mukund Seshadri
HPDC
2003
IEEE
13 years 10 months ago
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
Abstract. We present PlanetP, a peer-to-peer (P2P) content search and retrieval infrastructure targeting communities wishing to share large sets of text documents. P2P computing is...
Francisco Matias Cuenca-Acuna, Christopher Peery, ...