The Scheduled Transfer (ST) Protocol

Philp, I.R.; Liong, Yin-Ling

doi:10.1007/10704826_8

Cited by 5 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, the host system's bandwidth is more likely I/O-limited than CPU-limited. So, the key to improving bandwidth is to either improve the host system's ability to move data, decrease the amount of data that needs to be moved, or decrease the number of times that the data needs to be moved across the memory bus [18,19].…”

Section: Breaking the Bottlenecksmentioning

confidence: 99%

See 1 more Smart Citation

Optimizing 10-Gigabit Ethernet for Networks of Workstations, Clusters, and Grids: A Case Study

Feng¹

2003

View full text Add to dashboard Cite

show abstract

Section: Breaking the Bottlenecksmentioning

confidence: 99%

“…Rather than implement a complete TOE, we would like to see an implementation of a TCP header-parsing engine, e.g., a la ST [18]. Briefly, such an engine would use a hash table of established sockets to transfer the payload of incoming packets directly into user memory.…”

Section: Breaking the Bottlenecksmentioning

confidence: 99%

Optimizing 10-Gigabit Ethernet for Networks of Workstations, Clusters, and Grids: A Case Study

Feng¹

2003

View full text Add to dashboard Cite

show abstract

“…RBUDP is an exception, being specifically targeted at photonic networks. Another class of transport protocols, such as Scheduled Transfer (ST) [21] and RDDP [22], has been designed for OS-bypass implementations. At the 10Gbps rates, we expect bottlenecks within end hosts to require OS-bypass implementations.…”

Section: Related Workmentioning

confidence: 99%

Scheduling and Transport for File Transfers on High-Speed Optical Circuits

Veeraraghavan¹,

Zheng²,

Feng³

et al. 2003

Journal of Grid Computing

View full text Add to dashboard Cite

Scheduling resources on Grids is a well-known problem. The extension of Grids to LambdaGrids requires the scheduling of lambdas, i.e., end-to-end high-speed circuits. In this paper, we propose a scheduling heuristic for such lambdas in support of large-scale scientific applications that require high-throughput transfers of large files. We refer to this heuristic as "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.Enabling VBLS requires end host applications to specify the file size in their transfer requests. To characterize VBLS, we ran simulation experiments that show that VBLS performance approaches packet-switching performance. This result means that file transfers can take advantage of bandwidth that becomes available subsequent to the start of transfers, a current and critical drawback of typical fixed-bandwidth allocation schemes in circuit-switched networks. Next, we identify the key features needed in a transport protocol that works in conjunction with VBLS and develop the "Varying Bandwidth Transport Protocol" (VBTP). VBTP is a rate based flow control scheme that is coupled with Selective-ARQ based error control. Finally, the paper concludes with a discussion on the impact of transport problems on VBLS scheduling.

show abstract

Time-Sharing Parallel Jobs in the Presence of Multiple Resource Requirements

Petrini

Feng

2000

Job Scheduling Strategies for Parallel Processing

View full text Add to dashboard Cite

The Scheduled Transfer (ST) Protocol

Cited by 5 publications

References 9 publications

Optimizing 10-Gigabit Ethernet for Networks of Workstations, Clusters, and Grids: A Case Study

Optimizing 10-Gigabit Ethernet for Networks of Workstations, Clusters, and Grids: A Case Study

Scheduling and Transport for File Transfers on High-Speed Optical Circuits

Time-Sharing Parallel Jobs in the Presence of Multiple Resource Requirements

Contact Info

Product

Resources

About