Sciweavers

7065 search results - page 304 / 1413
» Iterative Scheduling Algorithms
Sort
View
CASES
2009
ACM
15 years 4 months ago
Mapping stream programs onto heterogeneous multiprocessor systems
This paper presents a partitioning and allocation algorithm for an iterative stream compiler, targeting heterogeneous multiprocessors with constrained distributed memory and any c...
Paul M. Carpenter, Alex Ramírez, Eduard Ayg...
ALT
2008
Springer
16 years 3 months ago
Entropy Regularized LPBoost
In this paper we discuss boosting algorithms that maximize the soft margin of the produced linear combination of base hypotheses. LPBoost is the most straightforward boosting algor...
Manfred K. Warmuth, Karen A. Glocer, S. V. N. Vish...
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
16 years 1 months ago
Scalable compile-time scheduler for multi-core architectures
As the number of cores continues to grow in both digital signal and general purpose processors, tools which perform automatic scheduling from model-based designs are of increasing...
Maxime Pelcat, Pierrick Menuet, Slaheddine Aridhi,...
175
Voted
INFOCOM
2007
IEEE
16 years 1 months ago
Adaptive Max-Min Fair Scheduling in Buffered Crossbar Switches Without Speedup
— A good crossbar switch scheduler should be able to achieve 100% throughput and maintain fairness among competing flows. A pure input-queued (IQ) non-buffered switch requires a...
Xiao Zhang, Satya Ranjan Mohanty, Laxmi N. Bhuyan
SIGMETRICS
2003
ACM
131views Hardware» more  SIGMETRICS 2003»
15 years 12 months ago
Classifying scheduling policies with respect to unfairness in an M/GI/1
It is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy’s fairness....
Adam Wierman, Mor Harchol-Balter