6437 search results - page 622 / 1288 » Parallel Algorithms for Arrangements |
181
Voted
PPOPP
2009
ACM
16 years 2 days ago
2009
ACM
Boosted transactions offer an attractive method that enables programmers to create larger transactions that scale well and offer deadlock-free guarantees. However, as boosted tran...
197
Voted
CIKM
2001
Springer
15 years 12 months ago
2001
Springer
Existing approaches for optimizing queries in data integration use decoupled strategies–attempting to optimize coverage and cost in two separate phases. Since sources tend to ha...
184
Voted
CCCG
2010
15 years 8 months ago
2010
In this paper, we consider a special type of triangular range search for a planar point set S in the I/O-model. Here, two sides of the query triangle are parallel to the coordinat...
170
click to vote
EOR
2008
15 years 7 months ago
2008
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
210
click to vote
CLUSTER
2006
IEEE
15 years 7 months ago
2006
IEEE
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...