Sciweavers

1407 search results - page 44 / 282
» Learning Abstract Scheduling Models
Sort
View
NIPS
2008
14 years 12 days ago
An Online Algorithm for Maximizing Submodular Functions
We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...
Matthew J. Streeter, Daniel Golovin
EMSOFT
2006
Springer
14 years 2 months ago
Incremental schedulability analysis of hierarchical real-time components
Embedded systems are complex as a whole but consist of smaller independent modules minimally interacting with each other. This structure makes embedded systems amenable to composi...
Arvind Easwaran, Insik Shin, Oleg Sokolsky, Insup ...
INFOCOM
2011
IEEE
13 years 2 months ago
Scheduling in mapreduce-like systems for fast completion time
Abstract—Large-scale data processing needs of enterprises today are primarily met with distributed and parallel computing in data centers. MapReduce has emerged as an important p...
Hyunseok Chang, Murali S. Kodialam, Ramana Rao Kom...
CSFW
2008
IEEE
14 years 5 months ago
Information Flow in Systems with Schedulers
Abstract. The focus of work on information flow security has primarily been on definitions of security in asynchronous systems models. This paper considers systems with scheduler...
Ron van der Meyden, Chenyi Zhang
CSCLP
2006
Springer
14 years 2 months ago
A Constraint Model for State Transitions in Disjunctive Resources
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...
Roman Barták, Ondrej Cepek