Sciweavers

1536 search results - page 281 / 308
» DPS - Dynamic Parallel Schedules
Sort
View
HPCA
2007
IEEE
15 years 11 months ago
Fully-Buffered DIMM Memory Architectures: Understanding Mechanisms, Overheads and Scaling
Performance gains in memory have traditionally been obtained by increasing memory bus widths and speeds. The diminishing returns of such techniques have led to the proposal of an ...
Brinda Ganesh, Aamer Jaleel, David Wang, Bruce L. ...
MIDDLEWARE
2007
Springer
15 years 5 months ago
A piggybacking approach to reduce overhead in sensor network gossiping
Many wireless sensor network protocols are employing gossipbased message dissemination, where nodes probabilistically forward messages, to reduce message overhead. We are concerne...
Ercan Ucan, Nathanael Thompson, Indranil Gupta
ICDT
2005
ACM
124views Database» more  ICDT 2005»
15 years 4 months ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken
MICRO
2003
IEEE
132views Hardware» more  MICRO 2003»
15 years 4 months ago
Checkpoint Processing and Recovery: Towards Scalable Large Instruction Window Processors
Large instruction window processors achieve high performance by exposing large amounts of instruction level parallelism. However, accessing large hardware structures typically req...
Haitham Akkary, Ravi Rajwar, Srikanth T. Srinivasa...
ICDE
2007
IEEE
123views Database» more  ICDE 2007»
16 years 16 days ago
A Cooperative, Self-Configuring High-Availability Solution for Stream Processing
We present a collaborative, self-configuring high availability (HA) approach for stream processing that enables low-latency failure recovery while incurring small run-time overhea...
Jeong-Hyon Hwang, Ying Xing, Ugur Çetinteme...