Sciweavers

231 search results - page 22 / 47
» Choice-Memory Tradeoff in Allocations
Sort
View
ECAI
1998
Springer
14 years 1 months ago
Optimal Scheduling of Dynamic Progressive Processing
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
Abdel-Illah Mouaddib, Shlomo Zilberstein
INFOCOM
1994
IEEE
14 years 28 days ago
Optimal Multiplexing on a Single Link: Delay and Buffer Requirements
This paper is motivated by the need to support multiple service classes in fast packet-switched networks. We address the problem of characterizing and designing scheduling policie...
Leonidas Georgiadis, Roch Guérin, Abhay K. ...
INFOCOM
1994
IEEE
14 years 28 days ago
A Dynamic Management Scheme for Real-Time Connections
Most of the solutions proposed to support real-time (i.e. guaranteed performance) communication services in packet-switching networks adopt a connection-oriented and reservation-o...
Colin Parris, Hui Zhang, Domenico Ferrari
BROADNETS
2004
IEEE
14 years 16 days ago
Handheld Routers: Intelligent Bandwidth Aggregation for Mobile Collaborative Communities
Multi-homed, mobile wireless computing and communication devices can spontaneously form communities to logically combine and share the bandwidth of each other's wide-area com...
Puneet Sharma, Sung-Ju Lee, Jack Brassil, Kang G. ...
CODES
2004
IEEE
14 years 16 days ago
Hardware synthesis from coarse-grained dataflow specification for fast HW/SW cosynthesis
This paper concerns automatic hardware synthesis from data flow graph (DFG) specification for fast HW/SW cosynthesis. A node in DFG represents a coarse grain block such as FIR and...
Hyunuk Jung, Soonhoi Ha