Sciweavers

316 search results - page 51 / 64
» Decoupling Computation and Data Scheduling in Distributed Da...
Sort
View
CSCW
2002
ACM
14 years 9 months ago
Work rhythms: analyzing visualizations of awareness histories of distributed groups
We examined records of minute-by-minute computer activity coupled with information about the location of the activity, online calendar appointments, and e-mail activity. We presen...
James Begole, John C. Tang, Randall B. Smith, Nico...
77
Voted
EUROSYS
2008
ACM
15 years 6 months ago
DepSpace: a byzantine fault-tolerant coordination service
The tuple space coordination model is one of the most interesting coordination models for open distributed systems due to its space and time decoupling and its synchronization pow...
Alysson Neves Bessani, Eduardo Adílio Pelin...
IPPS
2006
IEEE
15 years 3 months ago
WaveGrid: a scalable fast-turnaround heterogeneous peer-based desktop grid system
We propose a novel heterogeneous scalable desktop grid system, WaveGrid, which uses a peer-to-peer architecture and can satisfy the needs of applications with fastturnaround requi...
Dayi Zhou, Virginia Mary Lo
SIGMETRICS
2009
ACM
151views Hardware» more  SIGMETRICS 2009»
15 years 4 months ago
MapReduce optimization using regulated dynamic prioritization
We present a system for allocating resources in shared data and compute clusters that improves MapReduce job scheduling in three ways. First, the system uses regulated and user-as...
Thomas Sandholm, Kevin Lai
101
Voted
ICPP
1998
IEEE
15 years 1 months ago
A memory-layout oriented run-time technique for locality optimization
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
Yong Yan, Xiaodong Zhang, Zhao Zhang