Sciweavers

16128 search results - page 73 / 3226
» Distributed network scheduling
Sort
View
JSA
2000
115views more  JSA 2000»
14 years 9 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
MOBIHOC
2006
ACM
15 years 3 months ago
Wakeup scheduling in wireless sensor networks
A large number of practical sensing and actuating applications require immediate notification of rare but urgent events and also fast delivery of time sensitive actuation command...
Abtin Keshavarzian, Huang Lee, Lakshmi Venkatraman
CP
1998
Springer
15 years 2 months ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow
JSSPP
2010
Springer
14 years 7 months ago
The Gain of Resource Delegation in Distributed Computing Environments
Abstract. In this paper, we address job scheduling in Distributed Computing Infrastructures, that is a loosely coupled network of autonomous acting High Performance Computing syste...
Alexander Fölling, Christian Grimme, Joachim ...
ICPP
1999
IEEE
15 years 2 months ago
FLB: Fast Load Balancing for Distributed-Memory Machines
This paper describes a novel compile-time list-based task scheduling algorithm for distributed-memory systems, called Fast Load Balancing (FLB). Compared to other typical list sch...
Andrei Radulescu, Arjan J. C. van Gemund