Sciweavers

5448 search results - page 795 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
SPAA
1997
ACM
15 years 11 months ago
HARP: A Fast Spectral Partitioner
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...
Horst D. Simon, Andrew Sohn, Rupak Biswas
CSCW
2008
ACM
15 years 8 months ago
Providing awareness in multi-synchronous collaboration without compromising privacy
When involved in collaborative tasks, users often choose to use multi-synchronous applications in order to concurrently work in isolation. Hence, privacy of their changes is maint...
Claudia-Lavinia Ignat, Stavroula Papadopoulou, G&e...
CONEXT
2009
ACM
15 years 7 months ago
The age of impatience: optimal replication schemes for opportunistic networks
: We study mobile P2P content dissemination schemes which leverage the local dedicated caches provided by hand-held devices (e.g., smart-phones, PDAs) and opportunistic contacts be...
Joshua Reich, Augustin Chaintreau
CLUSTER
1999
IEEE
15 years 6 months ago
The Network RamDisk: Using remote memory on heterogeneous NOWs
Efficient data storage, a major concern in the modern computer industry, is mostly provided today by the the traditional magnetic disk. Unfortunately the cost of a disk transfer m...
Michail Flouris, Evangelos P. Markatos
HPCA
2011
IEEE
14 years 10 months ago
MOPED: Orchestrating interprocess message data on CMPs
Future CMPs will combine many simple cores with deep cache hierarchies. With more cores, cache resources per core are fewer, and must be shared carefully to avoid poor utilization...
Junli Gu, Steven S. Lumetta, Rakesh Kumar, Yihe Su...