Sciweavers

1451 search results - page 24 / 291
» Order independence and rationalizability
Sort
View
IPPS
2007
IEEE
16 years 18 days ago
Improving MPI Independent Write Performance Using A Two-Stage Write-Behind Buffering Method
Many large-scale production applications often have very long executions times and require periodic data checkpoints in order to save the state of the computation for program rest...
Wei-keng Liao, Avery Ching, Kenin Coloma, Alok N. ...
EMSOFT
2007
Springer
16 years 14 days ago
Scheduling multiple independent hard-real-time jobs on a heterogeneous multiprocessor
This paper proposes a scheduling strategy and an automatic scheduling flow that enable the simultaneous execution of multiple hard-real-time dataflow jobs. Each job has its own ...
Orlando Moreira, Frederico Valente, Marco Bekooij
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 11 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
ICCS
2004
Springer
15 years 11 months ago
Platform-Independent Cache Optimization by Pinpointing Low-Locality Reuse
Abstract. For many applications, cache misses are the primary performance bottleneck. Even though much research has been performed on automatically optimizing cache behavior at the...
Kristof Beyls, Erik H. D'Hollander
ICCL
1998
IEEE
15 years 10 months ago
Location-Independent Communication for Mobile Agents: A Two-Level Architecture
We study communication primitives for interaction between mobile agents. They can be classified into two groups. At a low level there are location dependent primitives that require...
Peter Sewell, Pawel T. Wojciechowski, Benjamin C. ...