Sciweavers

1257 search results - page 103 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
SPAA
1995
ACM
15 years 5 months ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
EUC
2007
Springer
15 years 7 months ago
Assured-Timeliness Integrity Protocols for Distributable Real-Time Threads with in Dynamic Distributed Systems
Networked embedded systems present unique challenges for system designers composing distributed applications with dyanmic, real-time, and resilience requirements. We consider the ...
Binoy Ravindran, Edward Curley, Jonathan Stephen A...
CCGRID
2005
IEEE
15 years 7 months ago
Task scheduling strategies for workflow-based applications in grids
Grid applications require allocating a large number of heterogeneous tasks to distributed resources. A good allocation is critical for efficient execution. However, many existing ...
James Blythe, S. Jain, Ewa Deelman, Yolanda Gil, K...
EURONGI
2006
Springer
15 years 5 months ago
Randomized Self-stabilizing Algorithms for Wireless Sensor Networks
Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of w...
Volker Turau, Christoph Weyer
AUSAI
2003
Springer
15 years 6 months ago
Guided Operators for a Hyper-Heuristic Genetic Algorithm
We have recently introduced a hyper-heuristic genetic algorithm (hyper-GA) with an adaptive length chromosome which aims to evolve an ordering of low-level heuristics so as to find...
Limin Han, Graham Kendall