Sciweavers

36 search results - page 5 / 8
» Optimal whitespace synchronization strategies
Sort
View
VEE
2005
ACM
199views Virtualization» more  VEE 2005»
14 years 1 months ago
Escape analysis in the context of dynamic compilation and deoptimization
In object-oriented programming languages, an object is said to escape the method or thread in which it was created if it can also be accessed by other methods or threads. Knowing ...
Thomas Kotzmann, Hanspeter Mössenböck
ATAL
2003
Springer
14 years 1 months ago
An asynchronous complete method for distributed constraint optimization
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...
VLDB
1997
ACM
134views Database» more  VLDB 1997»
13 years 12 months ago
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
R-tree based spatial join is useful because of both its superior performance and the wide spread implementation of R-trees. We present a new R-tree join method called BFRJ (Breadt...
Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner
ARTDB
1997
Springer
269views Database» more  ARTDB 1997»
13 years 12 months ago
Parallel Event Detection in Active Database Systems: The Heart of the Matter
This paper proposes a strategy for parallel composite event detection in Active database systems (DBS). Up to now, the detection is sequential and totally synchronized, and thus p...
Ulrike Jaeger, Johann K. Obermaier
IPPS
1999
IEEE
14 years 3 days ago
Relaxing Causal Constraints in PDES
One of the major overheads that prohibits the wide spread deployment of parallel discrete event simulation PDES is the need to synchronize the distributed processes in the simulat...
Narayanan V. Thondugulam, Dhananjai Madhava Rao, R...