Sciweavers

3148 search results - page 126 / 630
» On the Dynamic Initialization of Parallel Computers
Sort
View
ADC
2004
Springer
87views Database» more  ADC 2004»
15 years 8 months ago
On the Computation of Approximations of Database Queries
Reflective Relational Machines were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu in 1994, as variations of Turing machines which are suitable for the computation of ...
Flavio Antonio Ferrarotti, Jose Maria Turull Torre...
AAAI
1997
15 years 4 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
PPOPP
2011
ACM
14 years 6 months ago
Programming the memory hierarchy revisited: supporting irregular parallelism in sequoia
We describe two novel constructs for programming parallel machines with multi-level memory hierarchies: call-up, which allows a child task to invoke computation on its parent, and...
Michael Bauer, John Clark, Eric Schkufza, Alex Aik...
151
Voted
PDP
2003
IEEE
15 years 8 months ago
Load Balancing for Spatial-grid-based Parallel Numeric Simulations on Clusters of SMPs
Load distribution is an essential factor to parallel efficiency of numerical simulations that are based on spatial grids, especially on clusters of symmetric multiprocessors (SMPs...
Huaien Gao, Andreas Schmidt, Amitava Gupta, Peter ...
ICPPW
2006
IEEE
15 years 9 months ago
Multiple Flows of Control in Migratable Parallel Programs
Many important parallel applications require multiple flows of control to run on a single processor. In this paper, we present a study of four flow-of-control mechanisms: proces...
Gengbin Zheng, Laxmikant V. Kalé, Orion Sky...