Sciweavers

898 search results - page 59 / 180
» A Linear Tabling Mechanism
Sort
View
DEXAW
2005
IEEE
134views Database» more  DEXAW 2005»
14 years 1 months ago
Enabling High Data Availability in a DHT
Many decentralized and peer-to-peer applications require some sort of data management. Besides P2P file-sharing, there are already scenarios (e.g. BRICKS project [3]) that need m...
Predrag Knezevic, Andreas Wombacher, Thomas Risse
MICRO
2000
IEEE
133views Hardware» more  MICRO 2000»
14 years 4 days ago
Compiler controlled value prediction using branch predictor based confidence
Value prediction breaks data dependencies in a program thereby creating instruction level parallelism that can increase program performance. Hardware based value prediction techni...
Eric Larson, Todd M. Austin
HOTOS
2007
IEEE
13 years 11 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
MICRO
2000
IEEE
107views Hardware» more  MICRO 2000»
13 years 11 months ago
Register integration: a simple and efficient implementation of squash reuse
Register integration (or simply integration) is a mechanism for incorporating speculative results directly into a sequential execution using data-dependence relationships. In this...
Amir Roth, Gurindar S. Sohi
LCTRTS
1995
Springer
13 years 11 months ago
Scheduling of Hard Aperiodic Tasks in Hybrid Static/Dynamic Priority Systems
In this paper, we present a preemptive joint scheduling of hard deadline periodic and hard deadline aperiodic tasks on a uniprocessor real-time system. The scheduling has extended...
Jongwon Lee, Sungyoung Lee, Hyungill Kim