Sciweavers

657 search results - page 113 / 132
» Polynomial Time Algorithms for Minimum Energy Scheduling
Sort
View
SIGMETRICS
2008
ACM
159views Hardware» more  SIGMETRICS 2008»
14 years 11 months ago
Weighted fair sharing for dynamic virtual clusters
In a shared server infrastructure, a scheduler controls how quantities of resources are shared over time in a fair manner across multiple, competing consumers. It should support w...
Laura E. Grit, Jeffrey S. Chase
SIGMETRICS
2010
ACM
178views Hardware» more  SIGMETRICS 2010»
15 years 4 months ago
Optimality, fairness, and robustness in speed scaling designs
System design must strike a balance between energy and performance by carefully selecting the speed at which the system will run. In this work, we examine fundamental tradeoffs i...
Lachlan L. H. Andrew, Minghong Lin, Adam Wierman
RTSS
1992
IEEE
15 years 3 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin
JALC
2007
90views more  JALC 2007»
14 years 11 months ago
Learning Unary Automata
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
Gregor Gramlich, Ralf Herrmann
ICIP
2007
IEEE
15 years 6 months ago
Fast Computation of Zernike Moments For Rice Sorting System
— In a rice sorting system, the separation distance of one grain from another is determined by the amount of time taken to process the image of each grain. The closer the separat...
Chong-Yaw Wee, Paramesran Raveendran, Fumiaki Take...