5448 search results - page 132 / 1090 » Breakpoints and Time in Distributed Computations |
135
click to vote
SPDP
1991
IEEE
15 years 7 months ago
1991
IEEE
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
142
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
We show that timed automata can be used to model and to analyze timeliness properties of embedded system architectures. Using a case study inspired by industrial practice, we pres...
118
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents an efficient modeling scheme and a partitioning heuristic for parallelizing VLSI post-placement timing optimization. Encoding the paths with timing violations...
123
click to vote
IPPS
2003
IEEE
15 years 9 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...
146
click to vote
JSSPP
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Buffered coscheduling is a new methodology that can substantially increase resource utilization, improve response time, and simplify the development of the run-time suppo...