Skip to main navigation Skip to search Skip to main content

Stork data scheduler: Mitigating the data bottleneck in e-Science

  • Tevfik Kosar
  • , Mehmet Balman
  • , Esma Yildirim
  • , Sivakumar Kulasekaran
  • , Brandon Ross
  • Lawrence Berkeley National Laboratory
  • SUNY Buffalo
  • Louisiana State University

Research output: Contribution to journal › Article › peer-review

17 Scopus citations

Abstract

In this paper, we present the Stork data scheduler as a solution for mitigating the data bottleneck in e-Science and data-intensive scientific discovery. Stork focuses on planning, scheduling, monitoring and management of data placement tasks and application-level end-to-end optimization of networked inputs/outputs for petascale distributed e-Science applications. Unlike existing approaches, Stork treats data resources and the tasks related to data access and movement as first-class entities just like computational resources and compute tasks, and not simply the side-effect of computation. Stork provides unique features such as aggregation of data transfer jobs considering their source and destination addresses, and an application-level throughput estimation and optimization service. We describe how these two features are implemented in Stork and their effects on end-to-end data transfer performance.

Original languageEnglish
Pages (from-to)3254-3267
Number of pages14
JournalPhilosophical transactions. Series A, Mathematical, physical, and engineering sciences
Volume369
Issue number1949
DOIs
StatePublished - Aug 28 2011

Keywords

  • Data-intensive computing
  • E-Science
  • Input/output scheduling
  • Stork
  • Throughput optimization

Fingerprint

Dive into the research topics of 'Stork data scheduler: Mitigating the data bottleneck in e-Science'. Together they form a unique fingerprint.

Cite this