Lambda scheduling algorithm for file transfers on high-speed optical circuits

1 Scheduling resources on Grids is a well-known problem. The extension of Grids to LambdaGrids requires scheduling of lambdas, i.e., end-to-end high-speed circuits. In this paper, we propose a heuristic for the scheduling of lambdas specifically for file transfers, given that many eScience applications require high-throughput transfers of large files. We call this heuristic Varying-Bandwidth List Scheduling (VBLS) because the scheduler returns a time-range-capacity (TRC) allocation vector with varying bandwidth levels assigned for different time ranges within the duration of a transfer. The advantage of VBLS over a fixed-bandwidth allocation scheme is that it allows the scheduler to backfill any holes left in resource allocations. Such a scheme is enabled by end host applications specifying the file size in their transfer requests. To characterize VBLS, we used analytical models and ran simulations. Our results show that VBLS performance is close to packet-switching performance, which ...

• Type: Conference
• Year: 2004
• Where: CCGRID
• Authors: Hua Lee, Malathi Veeraraghavan, Hojun Li, Edwin K. P. Chong
• Keywords: CCGRID 2004, Distributed And Parallel Computing, File Transfers, Fixed-bandwidth Allocation Schemes, LambdaGrids Requires Scheduling