Sciweavers

247 search results - page 21 / 50
» Optimal Preemptive Scheduling for General Target Functions
Sort
View
134
Voted
SPAA
2005
ACM
15 years 9 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
127
Voted
HPCC
2005
Springer
15 years 9 months ago
Self-optimizing MPI Applications: A Simulation-Based Approach
Historically, high performance systems use schedulers and intelligent resource managers in order to optimize system usage and application performance. Most of the times, applicatio...
Emilio Mancini, Massimiliano Rak, Roberto Torella,...
126
Voted
GECCO
2009
Springer
108views Optimization» more  GECCO 2009»
15 years 8 months ago
Development of combinational circuits using non-uniform cellular automata: initial results
A non-uniform cellular automata-based model is presented for the evolutionary development of digital circuits at the gate level. The main feature of this model is the modified lo...
Michal Bidlo, Zdenek Vasícek
CGO
2008
IEEE
15 years 10 months ago
Modulo scheduling for highly customized datapaths to increase hardware reusability
In the embedded domain, custom hardware in the form of ASICs is often used to implement critical parts of applications when performance and energy efficiency goals cannot be met ...
Kevin Fan, Hyunchul Park, Manjunath Kudlur, Scott ...
110
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
On Scheduling for Minimizing End-to-End Buffer Usage over Multihop Wireless Networks
—While there has been much progress in designing backpressure based stabilizing algorithms for multihop wireless networks, end-to-end performance (e.g., end-to-end buffer usage) ...
V. J. Venkataramanan, Xiaojun Lin, Lei Ying, Sanja...