5448 search results - page 428 / 1090 » Breakpoints and Time in Distributed Computations |
193
click to vote
ICPP
1993
IEEE
15 years 11 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
207
click to vote
PARLE
1992
15 years 11 months ago
1992
Complex and data-intensive database queries mandate parallel processing strategies to achieve sufficiently short response times. In praxis, parallel database processing is mostly b...
182
click to vote
ICS
2000
Tsinghua U.
15 years 10 months ago
2000
Tsinghua U.
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
147
click to vote
SEC
2001
15 years 8 months ago
2001
Abstract When people want to schedule a meeting, their agendas must be compared to find a time suitable for all participants. At the same time, people want to keep their agendas pr...
183
click to vote
CONCUR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...