By Topic

Minimum Message Waiting Time Scheduling in Distributed Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Martelli, F. ; Ist. di Inf. e Telematica, Pisa, Italy ; Bonuccelli, M.A.

In this paper, we examine the problem of packet scheduling in a single-hop multichannel system, with the goal of minimizing the average message waiting time. Such an objective function represents the delay incurred by the users before receiving the desired data. We show that the problem of finding a schedule with minimum message waiting time is NP-complete, by means of polynomial time reduction of the time table design problem to our problem. We present also several heuristics that result in outcomes very close to the optimal ones. We compare these heuristics by means of extensive simulations.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:24 ,  Issue: 9 )