On line scheduling with optimal worst-case response time

On line scheduling with optimal worst-case response time

0.00 Avg rating0 Votes
Article ID: iaor19971351
Country: India
Volume: 15
Issue: 3
Start Page Number: 449
End Page Number: 460
Publication Date: Sep 1995
Journal: Journal of Information & Optimization Sciences
Authors:
Keywords: computational analysis
Abstract:

An on-line algorithm for scheduling independent processes in a distributed computer system is presented. Conflicting resource requests are the only scheduling constraints assumed. The response time for each process p is bounded by Q(Su+SV), where Q is the number of processes conflicting with p,u is the maximum execution time, and v is the message delay. As this is equal to the lower bound for response time, this is an optimal algorithm.

Reviews

Required fields are marked *. Your email address will not be published.