Sciweavers

822 search results - page 72 / 165
» Contention in shared memory algorithms
Sort
View
GIS
2003
ACM
14 years 10 months ago
An efficient r-tree implementation over flash-memory storage systems
For many applications with spatial data management such as Geographic Information Systems (GIS), block-oriented access over flash memory could introduce a significant number of no...
Chin-Hsien Wu, Li-Pin Chang, Tei-Wei Kuo
ARC
2006
Springer
124views Hardware» more  ARC 2006»
14 years 20 days ago
A Flexible Multi-port Caching Scheme for Reconfigurable Platforms
Abstract. Memory accesses contribute sunstantially to aggregate system delays. It is critical for designers to ensure that the memory subsystem is designed efficiently, and much wo...
Su-Shin Ang, George A. Constantinides, Peter Y. K....
ICS
2009
Tsinghua U.
14 years 1 months ago
Dynamic task set partitioning based on balancing memory requirements to reduce power consumption
ABSTRACT Because of technology advances power consumption has emerged up as an important design issue in modern high-performance microprocessors. As a consequence, research on redu...
Diana Bautista, Julio Sahuquillo, Houcine Hassan, ...
APCCM
2009
13 years 10 months ago
Modeling Natural Language Communication in Database Semantics
Database Semantics (DBS) is a computational model of how communicating with natural language works. at a level of abstraction which may be applied to natural and artificial agents...
Roland Hausser
PODC
2010
ACM
13 years 9 months ago
The k-bakery: local-spin k-exclusion using non-atomic reads and writes
Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneous...
Robert Danek