Sciweavers

2438 search results - page 306 / 488
» Scheduling problems for parallel and distributed systems
Sort
View
PODC
2010
ACM
15 years 8 months ago
Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
Guanfeng Liang, Nitin Vaidya
EDOC
2003
IEEE
15 years 11 months ago
Addressing Computational Viewpoint Design
Distributed System design is a highly complicated and non-trivial task. The problem is characterised by the need to design multi-threaded, multi-processor, and multimedia systems....
David H. Akehurst, John Derrick, A. Gill Waters
SIGMETRICS
2005
ACM
117views Hardware» more  SIGMETRICS 2005»
16 years 1 days ago
Classifying scheduling policies with respect to higher moments of conditional response time
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order...
Adam Wierman, Mor Harchol-Balter
EDOC
2004
IEEE
15 years 10 months ago
Using Subject-Oriented Modeling to Develop Jini Applications
A major contributing factor to the complexity of creating and evolving distributed systems is the tangling of middleware-specific functionality with core business functionality in...
Gagan Tandon, Sudipto Ghosh
PPOPP
2011
ACM
14 years 9 months ago
GRace: a low-overhead mechanism for detecting data races in GPU programs
In recent years, GPUs have emerged as an extremely cost-effective means for achieving high performance. Many application developers, including those with no prior parallel program...
Mai Zheng, Vignesh T. Ravi, Feng Qin, Gagan Agrawa...