Sciweavers

3148 search results - page 591 / 630
» On the Dynamic Initialization of Parallel Computers
Sort
View
SODA
2008
ACM
80views Algorithms» more  SODA 2008»
13 years 10 months ago
Provably good multicore cache performance for divide-and-conquer algorithms
This paper presents a multicore-cache model that reflects the reality that multicore processors have both per-processor private (L1) caches and a large shared (L2) cache on chip. ...
Guy E. Blelloch, Rezaul Alam Chowdhury, Phillip B....
OPODIS
2004
13 years 10 months ago
Lock-Free and Practical Doubly Linked List-Based Deques Using Single-Word Compare-and-Swap
Abstract. We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint accesses and uses atomic primitives which are ...
Håkan Sundell, Philippas Tsigas
CCCG
1993
13 years 9 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
CMPB
2010
141views more  CMPB 2010»
13 years 8 months ago
Real-time segmentation by Active Geometric Functions
Recent advances in 4D imaging and real-time imaging provide image data with clinically important cardiac dynamic information at high spatial or temporal resolution. However, the en...
Qi Duan, Elsa D. Angelini, Andrew F. Laine
PC
2006
113views Management» more  PC 2006»
13 years 8 months ago
Autonomous mobility skeletons
To manage load on large and dynamic networks we have developed Autonomous Mobile Programs (AMPs) that periodically use a cost model to decide where to execute. A disadvantage of d...
Xiao Yan Deng, Greg Michaelson, Philip W. Trinder