936 search results - page 99 / 188 » Task Graph Scheduling Using Timed Automata |
123
click to vote
DAC
1989
ACM
15 years 5 months ago
1989
ACM
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
176
click to vote
TOPNOC
2010
14 years 8 months ago
2010
Abstract. Contemporary workflow management systems offer workitems to users through specific work-lists. Users select the work-items they will perform without having a specific sch...
122
click to vote
CP
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
123
click to vote
EUROPAR
2005
Springer
15 years 7 months ago
2005
Springer
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
133
click to vote
ENTCS
2007
15 years 1 months ago
2007
This paper gives an overview of recent advances in Real-Time Maude. Real-Time Maude extends the Maude rewriting logic tool to support formal specification and analysis of object-...