Sciweavers

68 search results - page 7 / 14
» LoGPC: Modeling Network Contention in Message-Passing Progra...
Sort
View
QEST
2006
IEEE
14 years 1 months ago
Optimization of Cache Expiration Dates in Content Networks
One of the fundamental decisions in content networks is how the information about the existing contents is deployed and accessed. In particular, in many content network architectu...
Héctor Cancela, Pablo Rodríguez-Bocc...
CCGRID
2010
IEEE
13 years 8 months ago
Region-Based Prefetch Techniques for Software Distributed Shared Memory Systems
Although shared memory programming models show good programmability compared to message passing programming models, their implementation by page-based software distributed shared m...
Jie Cai, Peter E. Strazdins, Alistair P. Rendell
SIAMCOMP
1998
117views more  SIAMCOMP 1998»
13 years 7 months ago
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
This paper introduces the queue-read, queue-write (qrqw) parallel random access machine (pram) model, which permits concurrent reading and writing to shared memory locations, but ...
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachand...
SPAA
1993
ACM
13 years 11 months ago
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
Anja Feldmann, Thomas Stricker, Thomas E. Warfel
CONEXT
2008
ACM
13 years 9 months ago
On cooperative settlement between content, transit and eyeball internet service providers
Internet service providers (ISPs) depend on one another to provide global network services. However, the profit-seeking nature of the ISPs leads to selfish behaviors that result i...
Richard T. B. Ma, Dah-Ming Chiu, John C. S. Lui, V...