Sciweavers

247 search results - page 8 / 50
» Optimal Preemptive Scheduling for General Target Functions
Sort
View
CCGRID
2008
IEEE
14 years 1 months ago
Grid Differentiated Services: A Reinforcement Learning Approach
—Large scale production grids are a major case for autonomic computing. Following the classical definition of Kephart, an autonomic computing system should optimize its own beha...
Julien Perez, Cécile Germain-Renaud, Bal&aa...
TPDS
1998
124views more  TPDS 1998»
13 years 7 months ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
Lars Lundberg, Håkan Lennerstad
PAMI
2011
13 years 2 months ago
Approximately Global Optimization for Robust Alignment of Generalized Shapes
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
Hongsheng Li, Tian Shen, Xiaolei Huang
EMSOFT
2007
Springer
14 years 1 months ago
Optimal task placement to improve cache performance
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...
Gernot Gebhard, Sebastian Altmeyer
RTSS
2003
IEEE
14 years 20 days ago
A Dynamic Voltage Scaling Algorithm for Sporadic Tasks
Dynamic voltage scaling (DVS) algorithms save energy by scaling down the processor frequency when the processor is not fully loaded. Many algorithms have been proposed for periodi...
Ala' Qadi, Steve Goddard, Shane Farritor