Sciweavers

191 search results - page 21 / 39
» Melding Priority Queues
Sort
View
SPAA
2004
ACM
15 years 5 months ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
111
Voted
CIDR
2003
164views Algorithms» more  CIDR 2003»
15 years 1 months ago
Capacity Bound-free Web Warehouse
Web cache technologies have been developed as an extension of CPU cache, by modifying LRU (Least Recently Used) algorithms. Actually in web cache systems, we can use disks and ter...
Yahiko Kambayashi, Kai Cheng
ANOR
2010
130views more  ANOR 2010»
14 years 9 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
CORR
2010
Springer
231views Education» more  CORR 2010»
14 years 9 months ago
Delay-Based Back-Pressure Scheduling in Multi-Hop Wireless Networks
Scheduling is a critical and challenging resource allocation mechanism for multi-hop wireless networks. It is well known that scheduling schemes that give a higher priority to the ...
Bo Ji, Changhee Joo, Ness B. Shroff
117
Voted
TCOM
2010
168views more  TCOM 2010»
14 years 7 months ago
A unified analysis of routing protocols in MANETs
This paper presents a mathematical framework for the evaluation of the performance of proactive and reactive routing protocols in mobile ad hoc networks (MANETs). This unified fram...
Hui Xu, Xianren Wu, Hamid R. Sadjadpour, J. J. Gar...