Input/output characteristics of scalable parallel applications

Crandall, Phyllis E.; Aydt, Ruth; Chien, Andrew A.; Reed, Daniel A.

doi:10.1145/224170.224396

Cited by 120 publications

(70 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This workload is constructed based on publications on visualization systems [20,21,22], and has the following attributes: a random Poisson read access stream with a mean interarrival time of 50ms on a large data file. It currently does not make a difference to Figurehead whether a read stream is random or sequential, since Figurehead does not currently do any prefetching or caching.…”

Section: Validating the Mathematical Machinerymentioning

confidence: 99%

A Cost-Effective Distributed File Service with QoS Guarantees

Bianchini

Nguyen

2007

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Large-scale, value-added Internet services composed of independent cooperating or competing services will soon become common place. Several groups have addressed the performance, communication, discovery, and description aspects of these services. However, little work has been done on effectively composing paid services and the quality-of-service (QoS) guarantees that they provide. We address these issues in the context of distributed file storage in this paper. In particular, we propose, implement, and evaluate a cost-effective, QoSaware distributed file service comprising a front-end file service and back-end (third-party) storage services. Our front-end service uses mathematical modeling and optimization to provide performance and availability guarantees at low cost by carefully orchestrating the accesses to the back-end services. Experimental results from our prototype implementation validate our modeling and optimization. We conclude that our approach for providing QoS at low cost should be useful to future composite Internet services.

show abstract

Section: Validating the Mathematical Machinerymentioning

confidence: 99%

A Cost-Effective Distributed File Service with QoS Guarantees

Bianchini

Nguyen

2007

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The most often cited issues include the I/O access patterns exhibited by scientific applications (e.g., noncontiguous I/O [11][12][13]), poor file system support for parallel I/O optimizations, the high cost of enforcing strict file consistency semantics [14], and the latency of accessing I/O devices across a network. However, we believe that a more fundamental problem, whose solution would help alleviate all of these challenges, is the legacy view of a file as a linear sequence of bytes.…”

Section: Introductionmentioning

confidence: 99%

Interval Based I/O: A New Approach to Providing High Performance Parallel I/O

Logan

Dickens

2011

2011 40th International Conference on Parallel Processing Workshops

View full text Add to dashboard Cite

show abstract

“…As shown by several studies [2,4], parallel I/O access uses recurrent, determined patterns based on stride parameters that are good candidates for optimization.…”

Section: Introductionmentioning

confidence: 99%

A Novel network request scheduler for a large scale storage system

Qian¹,

Barton

Wang

et al. 2009

Comp. Sci. Res. Dev.

View full text Add to dashboard Cite

This paper presents a novel Network Request Scheduler (NRS) for a large-scale, Lustre TM storage system. It proposes a quantum-based, Object Based Round Robin (OBRR) NRS algorithm that reorders the execution of I/O requests per data object, presenting a workload to backend storage that can be optimized more easily. According to the drawback of static deadlines in large-scale workloads, it proposes a novel, two-level deadline setting strategy that not only avoids starvation, but also guarantees that urgent I/O requests are serviced in a specified time period. Via a series of simulation experiments using a Lustre simulator, it demonstrates that I/O performance increases as much as 40% when using the OBRR NRS algorithm, and the two-level deadline setting strategy can avoid starvation and ensure that urgent I/O requests are serviced in the required time.

show abstract

Input/output characteristics of scalable parallel applications

Cited by 120 publications

References 21 publications

A Cost-Effective Distributed File Service with QoS Guarantees

A Cost-Effective Distributed File Service with QoS Guarantees

Interval Based I/O: A New Approach to Providing High Performance Parallel I/O

A Novel network request scheduler for a large scale storage system

Contact Info

Product

Resources

About