Using Formal Grammars to Predict I/O Behaviors in HPC: The Omnisc'IO Approach

Dorier, Matthieu; Ibrahim, Shadi; Antoniu, Gabriel; Ross, Rob

doi:10.1109/tpds.2015.2485980

Cited by 22 publications

(9 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For representing symbolic sequences, context-free grammars have been widely used in text compression, natural language processing, music processing, and macromolecular sequence modeling [11]. A context-free grammar provides a simple and mathematically precise mechanism for describing the methods by which phrases in language are built from smaller blocks, capturing the block structure of sentences in a natural way.…”

Section: Intra-process Compressionmentioning

confidence: 99%

Synthesizing Proxy Applications for MPI Programs

Yan¹,

Xu²,

Luo³

et al. 2023

Preprint

View full text Add to dashboard Cite

Proxy applications (proxy-apps) are fundamental tools for evaluating the performance of specific workloads on high-performance computing (HPC) systems. Since the development of high-fidelity proxy-apps, which exhibit similar performance characteristics as corresponding production applications, is labor-intensive, synthetic proxy-apps are created as a useful supplement to manually-developed proxy-apps. Existing proxyapp synthesis methods for HPC applications mainly focus on either communications patterns or computation kernels. To thoroughly resemble performance characteristics of HPC applications represented by Message Passing Interface (MPI) programs, we propose Siesta, a novel framework to automatically synthesize proxyapps based on communication-computation traces. Given an MPI program, Siesta synthesizes parameterized code proxies to mimic computation behaviors in different execution periods, and combines the code snippets and MPI function records into an event trace. It then extracts program behavior patterns from the trace using context-free grammars, and finally transforms the grammars into executable code as a synthetic proxy-app of the given MPI program. We evaluate the proposed methods on representative MPI programs with different parallel scales. The results show that our synthetic proxy-apps can precisely approximate the performance characteristics of MPI programs.

show abstract

Section: Intra-process Compressionmentioning

confidence: 99%

Synthesizing Proxy Applications for MPI Programs

Yan¹,

Xu²,

Luo³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Based on that, the applications are scheduled avoiding I/O conflicts. Other works that use models to predict and avoid the application I/O interference are [1,10,26].…”

Section: Related Workmentioning

confidence: 99%

“…• Their number of iterations n i is chosen uniformly at random between 250 and 1000. • w i is chosen uniformly at random in [10,100].…”

Section: Synthetic Workload Generationmentioning

confidence: 99%

Mapping and scheduling HPC applications for optimizing I/O

Carretero

Jeannot

Pallez

et al. 2020

Proceedings of the 34th ACM International Conference on Supercomputing

View full text Add to dashboard Cite

In HPC platforms, concurrent applications are sharing the same file system. This can lead to conflicts, especially as applications are more and more data intensive. I/O contention can represent a performance bottleneck. The access to bandwidth can be split in two complementary yet distinct problems. The mapping problem and the scheduling problem. The mapping problem consists in selecting the set of applications that are in competition for the I/O resource. The scheduling problem consists then, given I/O requests on the same resource, in determining the order to these accesses to minimize the I/O time. In this work we propose to couple a novel bandwidth-aware mapping algorithm to I/O list-scheduling policies to develop a cross-layer optimization solution.We study this solution experimentally using an I/O middleware: CLARISSE. We show that naive policies such as FIFO perform relatively well in order to schedule I/O movements, and that the important part to reduce congestion lies mostly on the mapping part. We evaluate the algorithm that we propose using a simulator that we validated experimentally. This evaluation shows important gains for the simple, bandwidth-aware mapping solution that we provide compared to its non bandwidth-aware counterpart. The gains are both in terms of machine efficiency (makespan) and application efficiency (stretch). This stresses even more the importance of designing efficient, bandwidth-aware mapping strategies to alleviate the cost of I/O congestion.

show abstract

“…Characterizing I/O patterns is key as it allows the developers to identify performance bottlenecks, and allows the system administrator to better configure the platforms. A complementary path is to predict I/O performances during execution [4]. Such instrumentation efforts allow for a better use of the scarce communication resources.…”

Section: Related Workmentioning

confidence: 99%

Interference-Aware Scheduling Using Geometric Constraints

Bleuse

Dogeas

Lucarelli

et al. 2018

Euro-Par 2018: Parallel Processing

View full text Add to dashboard Cite

The large scale parallel and distributed platforms produce a continuously increasing amount of data which have to be stored, exchanged and used by various jobs allocated on different nodes of the platform. The management of this huge communication demand is crucial for the performance of the system. Meanwhile, we have to deal with more interferences as the trend is to use a single all-purpose interconnection network. In this paper, we consider two different types of communications: the flows induced by data exchanges during computations and the flows related to Input/Output operations. We propose a general model for interference-aware scheduling, where explicit communications are replaced by external topological constraints. Specifically, we limit the interferences of both communication types by adding geometric constraints on the allocation of jobs into machines. The proposed constraints reduce implicitly the data movements by restricting the set of possible allocations for each job. We present this methodology on the case study of simple network topologies, namely the line and the ring. We propose theoretical lower and upper bounds under different assumptions with respect to the platform and jobs characteristics. The obtained results illustrate well the difficulty of the problem even on simple topologies.

show abstract

Using Formal Grammars to Predict I/O Behaviors in HPC: The Omnisc'IO Approach

Cited by 22 publications

References 26 publications

Synthesizing Proxy Applications for MPI Programs

Synthesizing Proxy Applications for MPI Programs

Mapping and scheduling HPC applications for optimizing I/O

Interference-Aware Scheduling Using Geometric Constraints

Contact Info

Product

Resources

About