Sciweavers

4820 search results - page 802 / 964
» Clustering Social Networks
Sort
View
ICDCS
2007
IEEE
16 years 1 months ago
A High Throughput Atomic Storage Algorithm
This paper presents an algorithm to ensure the atomicity of a distributed storage that can be read and written by any number of clients. In failure-free and synchronous situations...
Rachid Guerraoui, Dejan Kostic, Ron R. Levy, Vivie...
ICDCSW
2007
IEEE
16 years 1 months ago
Object-Swapping for Resource-Constrained Devices
Mobile devices are still memory-constrained when compared to desktop and laptop computers. Thus, in some circumstances, even while occupied by useful objects, some memory must be ...
Luís Veiga, Paulo Ferreira
IPPS
2007
IEEE
16 years 1 months ago
New Results on the Performance Effects of Autocorrelated Flows in Systems
Temporal dependence within the workload of any computing or networking system has been widely recognized as a significant factor affecting performance. More specifically, burstin...
Evgenia Smirni, Qi Zhang, Ningfang Mi, Alma Riska,...
172
Voted
HIPC
2007
Springer
16 years 1 months ago
A Scalable Asynchronous Replication-Based Strategy for Fault Tolerant MPI Applications
As computational clusters increase in size, their mean-time-to-failure reduces. Typically checkpointing is used to minimize the loss of computation. Most checkpointing techniques, ...
John Paul Walters, Vipin Chaudhary
SC
2005
ACM
16 years 19 days ago
Transformations to Parallel Codes for Communication-Computation Overlap
This paper presents program transformations directed toward improving communication-computation overlap in parallel programs that use MPI’s collective operations. Our transforma...
Anthony Danalis, Ki-Yong Kim, Lori L. Pollock, D. ...