Sciweavers

4081 search results - page 608 / 817
» Scheduling in polling systems
Sort
View
ESA
1998
Springer
105views Algorithms» more  ESA 1998»
15 years 11 months ago
Maximizing Job Completions Online
We consider the problem of maximizingthe number of jobs completed by their deadlinein an online single processor system where the jobs are preemptable and have release times. So i...
Bala Kalyanasundaram, Kirk Pruhs
VLDB
1993
ACM
112views Database» more  VLDB 1993»
15 years 11 months ago
Specifying and Enforcing Intertask Dependencies
Extensions of the traditional atomic transaction model are needed to support the development of multi-system applications or work ows that access heterogeneous databases and legac...
Paul C. Attie, Munindar P. Singh, Amit P. Sheth, M...
HIPC
2007
Springer
15 years 11 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
CCGRID
2001
IEEE
15 years 10 months ago
Compute Power Market: Towards a Market-Oriented Grid
The Compute Power Market (CPM) is a market-based resource management and job scheduling system for grid computing on Internet-wide computational resources, particularly low-end pe...
Rajkumar Buyya, Sudharshan Vazhkudai
JCDL
2010
ACM
166views Education» more  JCDL 2010»
15 years 9 months ago
Timeline interactive multimedia experience (time): on location access to aggregate event information
Attending a complex scheduled social event, such as a multi-day music festival, requires a significant amount of planning before and during its progression. Advancements in mobile...
Jeff Crow, Eryn Whitworth, Ame Wongsa, Luis Franci...