Sciweavers

310 search results - page 45 / 62
» From Non-Negative to General Operator Cost Partitioning
Sort
View
IWMM
2009
Springer
152views Hardware» more  IWMM 2009»
15 years 5 months ago
A new approach to parallelising tracing algorithms
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
Cosmin E. Oancea, Alan Mycroft, Stephen M. Watt
SOSP
2009
ACM
15 years 8 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
IMC
2010
ACM
14 years 9 months ago
Performance comparison of 3G and metro-scale WiFi for vehicular network access
We perform a head-to-head comparison of the performance characteristics of a 3G network operated by a nation-wide provider and a metro-scale WiFi network operated by a commercial ...
Pralhad Deshpande, Xiaoxiao Hou, Samir R. Das
ICS
2005
Tsinghua U.
15 years 4 months ago
System noise, OS clock ticks, and fine-grained parallel applications
As parallel jobs get bigger in size and finer in granularity, “system noise” is increasingly becoming a problem. In fact, fine-grained jobs on clusters with thousands of SMP...
Dan Tsafrir, Yoav Etsion, Dror G. Feitelson, Scott...
ERLANG
2003
ACM
15 years 4 months ago
A study of Erlang ETS table implementations and performance
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
Scott Lystig Fritchie