Download now Free registration required
In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcasting a page can satisfy multiple outstanding requests for that page. The authors consider online scheduling of requests when they have deadlines. Unlike previous models, which mainly consider the objective of maximizing throughput while respecting deadlines, here the authors focus on scheduling all the given requests with the goal of minimizing the maximum delay factor.
- Format: PDF
- Size: 207 KB