Sciweavers

252 search results - page 31 / 51
» Task Assignment and Scheduling under Memory Constraints
Sort
View
ATAL
2001
Springer
13 years 12 months ago
Dynamic Distributed Resource Allocation: A Distributed Constraint Satisfaction Approach
Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as distributed senso...
Pragnesh Jay Modi, Hyuckchul Jung, Milind Tambe, W...
EVOW
2006
Springer
13 years 11 months ago
The Trade Off Between Diversity and Quality for Multi-objective Workforce Scheduling
In this paper we investigate and compare multi-objective and weighted single objective approaches to a real world workforce scheduling problem. For this difficult problem we consid...
Peter I. Cowling, Nic Colledge, Keshav P. Dahal, S...
EUROPAR
1997
Springer
13 years 11 months ago
Modulo Scheduling with Cache Reuse Information
Instruction scheduling in general, and software pipelining in particular face the di cult task of scheduling operations in the presence of uncertain latencies. The largest contrib...
Chen Ding, Steve Carr, Philip H. Sweany
CISS
2008
IEEE
14 years 1 months ago
Distributed algorithm and reversible network
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
Shreevatsa Rajagopalan, Devavrat Shah
RTCSA
2006
IEEE
14 years 1 months ago
Computing the Minimum EDF Feasible Deadline in Periodic Systems
In most real-time applications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requiremen...
Hoai Hoang, Giorgio C. Buttazzo, Magnus Jonsson, S...