Sciweavers

1719 search results - page 104 / 344
» Scheduling with soft constraints
Sort
View
JMLR
2012
12 years 1 months ago
Constrained 1-Spectral Clustering
An important form of prior information in clustering comes in form of cannot-link and must-link constraints. We present a generalization of the popular spectral clustering techniq...
Syama Sundar Rangapuram, Matthias Hein
JPDC
2006
85views more  JPDC 2006»
13 years 10 months ago
Provable algorithms for parallel generalized sweep scheduling
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
RTCSA
2008
IEEE
14 years 5 months ago
Maximizing the Fault Tolerance Capability of Fixed Priority Schedules
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
Radu Dobrin, Hüseyin Aysan, Sasikumar Punnekk...
ECRTS
2006
IEEE
14 years 4 months ago
Task Reweighting under Global Scheduling on Multiprocessors
We consider schemes for enacting task share changes—a process called reweighting—on real-time multiprocessor platforms. Our particular focus is reweighting schemes that are de...
Aaron Block, James H. Anderson, UmaMaheswari C. De...
EUROSYS
2008
ACM
14 years 16 days ago
Efficient guaranteed disk request scheduling with fahrrad
Guaranteed I/O performance is needed for a variety of applications ranging from real-time data collection to desktop multimedia to large-scale scientific simulations. Reservations...
Anna Povzner, Tim Kaldewey, Scott A. Brandt, Richa...