Sciweavers

11 search results - page 1 / 3
» Computation of Buffer Capacities for Throughput Constrained ...
Sort
View
DATE
2008
IEEE
90views Hardware» more  DATE 2008»
14 years 5 months ago
Computation of Buffer Capacities for Throughput Constrained and Data Dependent Inter-Task Communication
Abstract - Streaming applications are often implemented as task graphs. Currently, techniques exist to derive buffer capacities that guarantee satisfaction of a throughput constrai...
Maarten Wiggers, Marco Bekooij, Gerard J. M. Smit
ASPDAC
2010
ACM
143views Hardware» more  ASPDAC 2010»
13 years 9 months ago
Constrained global scheduling of streaming applications on MPSoCs
Abstract-- We present a global scheduling framework for synchronous data flow (SDF) streaming applications on MPSoCs, based on optimized computation and contention-free routing. Th...
Jun Zhu, Ingo Sander, Axel Jantsch
EURONGI
2006
Springer
14 years 2 months ago
Job Scheduling for Maximal Throughput in Autonomic Computing Systems
Abstract. Autonomic computing networks manage multiple tasks over a distributed network of resources. In this paper, we view an autonomic computing system as a network of queues, w...
Kevin Ross, Nicholas Bambos
INFOCOM
2006
IEEE
14 years 5 months ago
Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
Prasanna Chaporkar, Saswati Sarkar
QSHINE
2005
IEEE
14 years 4 months ago
On Increasing End-to-End Throughput in Wireless Ad Hoc Networks
One of the main characteristics of wireless ad hoc networks is their node-centric broadcast nature of communication, leading to interferences and spatial contention between adjace...
Zongpeng Li, Baochun Li