Sciweavers

5448 search results - page 445 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
IPPS
2006
IEEE
16 years 26 days ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...
CCGRID
2005
IEEE
16 years 14 days ago
OGSA-based grid workload monitoring
In heterogeneous and dynamic distributed systems like the Grid, detailed monitoring of workload and its resulting system performance (e.g. response time) is required to facilitate...
Rui Zhang, Steve Moyle, Steve McKeever, Stephen He...
165
Voted
IPPS
2005
IEEE
16 years 13 days ago
On the Scalability of Centralized Control
Scalability of clusters and MPPs is typically discussed in terms of limits on growth: something which grows at a rate of O(log p) (where p is the number of processors) is said to ...
Dror G. Feitelson
ICPP
2003
IEEE
16 years 4 days ago
Accurately Modeling Workload Interactions for Deploying Prefetching in Web Servers
Although Web prefetching is regarded as an effective method to improve client access performance, the associated overhead prevents it from being widely deployed. Specifically, a ...
Xin Chen, Xiaodong Zhang
SPAA
2003
ACM
16 years 3 days ago
Online oblivious routing
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...