Sciweavers

550 search results - page 43 / 110
» Inherently Parallel Geometric Computations
Sort
View
STACS
1997
Springer
14 years 2 months ago
Strict Sequential P-completeness
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best kn...
Klaus Reinhardt
WSC
1998
13 years 11 months ago
Interference Radius in PCS Radio Resource Management Simulations
Simulation is widely used for performance analysis of Personal Communication Systems due to their inherent complexity. However, resource demands (cpu-time and memory requirements)...
Michael Liljenstam, Rassul Ayani
PPOPP
2012
ACM
12 years 5 months ago
Deterministic parallel random-number generation for dynamic-multithreading platforms
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be bui...
Charles E. Leiserson, Tao B. Schardl, Jim Sukha
PDCAT
2007
Springer
14 years 4 months ago
Grid Unit: A Self-Managing Building Block for Grid System
—Grid system software is inherently complex, hard to build and maintain. In this paper, we propose a selfmanaging building block: Grid Unit, which facilitates constructing Grid s...
Jianfeng Zhan, Lei Wang, Ming Zou, Hui Wang, Shuan...
PODC
2010
ACM
14 years 1 months ago
On maintaining multiple versions in STM
An effective way to reduce the number of aborts in software transactional memory (STM) is to keep multiple versions of transactional objects. In this paper, we study inherent prop...
Dmitri Perelman, Rui Fan, Idit Keidar