Title
Enhancing File Transfer Scheduling and Server Utilization in Data Distribution Infrastructures
Abstract
This paper presents a methodology for efficiently solving the file transfer scheduling problem in a distributed environment. Our solution is based on the relaxation of an objective-based time-indexed formulation of a linear programming problem. The main contributions of this paper are the following. First, we introduce a novel approach to the relaxation of the time-indexed formulation of the transfer scheduling problem in multi-server and multi-user environments. Our solution consists of reducing the complexity of the optimization by transforming it into an approximation problem, whose proximity to the optimal solution can be controlled depending on practical and computational needs. Second, we present a distributed deployment of our methodology, which leverages the inherent parallelism of the divide-and-conquer approach in order to speed-up the solving process. Third, we demonstrate that our methodology is able to considerably reduce the schedule length and idle time in a computationally tractable way.
Year
DOI
Venue
2012
10.1109/MASCOTS.2012.55
MASCOTS
Keywords
Field
DocType
divide-and-conquer approach,file transfer scheduling problem,server utilization,linear programming problem,data distribution infrastructures,computational need,approximation problem,novel approach,optimal solution,time-indexed formulation,objective-based time-indexed formulation,enhancing file transfer scheduling,transfer scheduling problem,computational modeling,scheduling,schedules,mathematical model,data handling,servers
Multiprocessor scheduling,Job shop scheduling,Fair-share scheduling,Computer science,Two-level scheduling,Real-time computing,Schedule,Rate-monotonic scheduling,File transfer,Dynamic priority scheduling,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
12
Authors
4
Name
Order
Citations
PageRank
Daniel Higuero1483.97
Juan M. Tirado2614.54
Florin Isaila323424.01
Jesus Carretero423929.04