Sciweavers

219 search results - page 40 / 44
» Time and Space Lower Bounds for Implementations Using k-CAS
Sort
View
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
14 years 20 days ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
CORR
2007
Springer
151views Education» more  CORR 2007»
13 years 8 months ago
Exploiting Multi-Antennas for Opportunistic Spectrum Sharing in Cognitive Radio Networks
—In cognitive radio (CR) networks, there are scenarios where the secondary (lower priority) users intend to communicate with each other by opportunistically utilizing the transmi...
Rui Zhang, Ying-Chang Liang
EDBT
2008
ACM
161views Database» more  EDBT 2008»
14 years 8 months ago
Load distribution of analytical query workloads for database cluster architectures
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
Thomas Phan, Wen-Syan Li
TCS
1998
13 years 8 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...
RTAS
2006
IEEE
14 years 2 months ago
Memory Footprint Reduction with Quasi-Static Shared Libraries in MMU-less Embedded Systems
Despite a rapid decrease in the price of solid state memory devices, system memory is still a very precious resource in embedded systems. The use of shared libraries is known to b...
Jaesoo Lee, Jiyong Park, Seongsoo Hong