Sciweavers

467 search results - page 68 / 94
» The General Yard Allocation Problem
Sort
View
INFOCOM
2012
IEEE
11 years 9 months ago
Fair background data transfers of minimal delay impact
—In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short TCP transfers and c...
Costas Courcoubetis, Antonis Dimakis
RTS
2002
154views more  RTS 2002»
13 years 6 months ago
Flexible Soft Real-Time Processing in Middleware
As desktop computer computational power continues to increases dramatically, it is becoming commonplace to run a combination of deadline-sensitive applications. Despite the prolif...
Scott A. Brandt, Gary J. Nutt
CIKM
2009
Springer
14 years 1 months ago
Dynamic in-page logging for flash-aware B-tree index
This paper presents Dynamic IPL B+ -tree (d-IPL in short) as a B+ -tree index variant for flash-based storage systems. The d-IPL B+ -tree adopts a dynamic In-Page Logging (IPL) s...
Gap-Joo Na, Sang-Won Lee, Bongki Moon
INFOCOM
2006
IEEE
14 years 24 days ago
Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
Michael J. Neely
EMSOFT
2005
Springer
14 years 9 days ago
Using de-optimization to re-optimize code
The nature of embedded systems development places a great deal of importance on meeting strict requirements in areas such as static code size, power consumption, and execution tim...
Stephen Hines, Prasad Kulkarni, David B. Whalley, ...