1536 search results - page 71 / 308 » DPS - Dynamic Parallel Schedules |
145
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
185
click to vote
ICPP
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper presents a new schedulability analysis methodology for distributed hard real-time systems with bursty job arrivals. The schedulability is analyzed by comparing worst-ca...
191
click to vote
DFVLR
1987
15 years 9 months ago
1987
: This paper examines the argument for dataflow architectures in "Two Fundamental Issues in Multiprocessing[5]." We observe two key problems. First, the justification of ...
149
click to vote
RTSS
1999
IEEE
15 years 10 months ago
1999
IEEE
Packet switching in connection-oriented networks that may have multiple parallel links between pairs of switches is considered. An e cient packet-scheduling algorithm that guarant...
156
click to vote
IJCAI
1989
15 years 7 months ago
1989
In this paper, a distributed heuristic search algorithm is presented. We show that the algorithm is admissible and give an informal analysis of its load balancing, scalability, an...