Sciweavers

517 search results - page 7 / 104
» Approximation Algorithms for Scheduling with Reservations
Sort
View
ECRTS
2010
IEEE
14 years 11 months ago
AIRS: Supporting Interactive Real-Time Applications on Multicore Platforms
Modern real-time systems increasingly operate with multiple interactive applications. While these systems often require reliable quality of service (QoS) for the applications, eve...
Shinpei Kato, Ragunathan Rajkumar, Yutaka Ishikawa
FORMATS
2007
Springer
15 years 4 months ago
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Sergio Giro, Pedro R. D'Argenio
DFG
2009
Springer
15 years 4 months ago
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz,...
WIOPT
2010
IEEE
14 years 8 months ago
Reservation policies for revenue maximization from secondary spectrum access in cellular networks
We consider the problem of providing opportunistic spectrum access to secondary users in wireless cellular networks. From the standpoint of spectrum license holders, achieving ben...
Ashraf Al Daoud, Murat Alanyali, David Starobinski
MOBIHOC
2008
ACM
15 years 9 months ago
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Tha...