Sciweavers

790 search results - page 85 / 158
» Limits of Work-Stealing Scheduling
Sort
View
CCGRID
2002
IEEE
15 years 11 months ago
A Malleable-Job System for Timeshared Parallel Machines
Malleable jobs are parallel programs that can change the number of processors on which they are executing at run time in response to an external command. One of the advantages of ...
Laxmikant V. Kalé, Sameer Kumar, Jayant DeS...
EOR
2007
82views more  EOR 2007»
15 years 6 months ago
Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
: New semiconductor wafer fabrication facilities use Front Opening Unified Pods (FOUPs) as a common unit of wafer transfer. Since the number of pods is limited due to high costs, a...
Jeffrey D. Laub, John W. Fowler, Ahmet B. Keha
CSREAESA
2010
15 years 4 months ago
Customizable and Predictable Synchronization in a Component-Based OS
Component-based operating systems enable embedded systems to adapt system policies, mechanisms, and abstractions to the specific workloads and contexts of each system. The scope o...
Gabriel Parmer, Jiguo Song
ICUMT
2009
15 years 3 months ago
Adaptive resource control in 2-hop ad-hoc networks
This paper presents a simple resource control mechanism with traffic scheduling for 2-hop ad-hoc networks, in which the Request-To-Send (RTS) packet is utilized to deliver feedback...
Yimeng Yang, Geert J. Heijenk, Boudewijn R. Haverk...
ASPLOS
2012
ACM
14 years 1 months ago
An update-aware storage system for low-locality update-intensive workloads
Traditional storage systems provide a simple read/write interface, which is inadequate for low-locality update-intensive workloads because it limits the disk scheduling flexibili...
Dilip Nijagal Simha, Maohua Lu, Tzi-cker Chiueh