Show simple item record

dc.contributor.advisor Varman, Peter J.
dc.creatorGulati, Ajay
dc.date.accessioned 2009-06-04T08:12:45Z
dc.date.available 2009-06-04T08:12:45Z
dc.date.issued 2005
dc.identifier.citation Gulati, Ajay. "Scheduling with QoS in parallel I/O systems." (2005) Master’s Thesis, Rice University. https://hdl.handle.net/1911/17788.
dc.identifier.urihttps://hdl.handle.net/1911/17788
dc.description.abstract Parallel I/O architectures have become attractive in the context of high performance computing and services provided by high bandwidth data centers. It is challenging to provide a scheduling technique that maximizes throughput and can provide QoS guarantees. In this thesis we first introduce the problem of maximizing the throughput for a parallel I/O system that is simultaneously accessed by several concurrent applications. We show that the problem of obtaining a minimum length schedule is NP-complete. We present fairness metrics for parallel I/O and provide fair scheduling schemes for some representative situations. In particular we study schemes that support fairness at every I/O step (local fairness) and during a certain window of time (global fairness). We also present a more general algorithm for weighted allocation of disk system bandwidth to multiple reference strings. All the three algorithms have low polynomial time complexity and they are work conserving.
dc.format.extent 79 p.
dc.format.mimetype application/pdf
dc.language.iso eng
dc.subjectElectronics
Electrical engineering
Operations research
Computer science
dc.title Scheduling with QoS in parallel I/O systems
dc.type Thesis
dc.type.material Text
thesis.degree.department Electrical Engineering
thesis.degree.discipline Engineering
thesis.degree.grantor Rice University
thesis.degree.level Masters
thesis.degree.name Master of Science
dc.identifier.callno THESIS E.E. 2005 GULATI


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record