A New Task Graph Model for Mapping Message Passing Applications
MetadataShow full item record
The exploitation of parallelism in a message passing platform implies a previous modeling phase of the parallel application as a task graph, which properly reflects its temporal behavior. In this paper, we analyze the classical task graph models of the literature and their drawbacks when modeling
message passing programs with an arbitrary task structure. We define a new task graph model called Temporal Task Interaction Graph (TTIG) that integrates the classical models used in the literature. The TTIG allows us to explicitly capture the ability of concurrency of adjacent tasks for applications where adjacent tasks can communicate at any point inside them. A mapping strategy is developed from this model, which minimizes the expected execution time by properly exploiting task parallelism. The effectiveness of this approach has been proved in different experimentation scopes for a wide range of message passing applications.
Is part ofIEEE Transactions on Parallel and Distributed Systems, 2007, vol. 18, núm. 12, p. 1740-1753
Showing items related by title, author, creator and subject.
Guirado Fernández, Fernando; Ripoll, A.; Roig Mateu, Concepció; Luque, Emilio (Springer Verlag, 2004)Pipeline applications simultaneously execute different instances from an input data set. Performance parameters for such applications are latency (the time taken to process an individual data set) and throughput (the ...
Roig Mateu, Concepció; Ripoll, A.; Senar, M.A.; Guirado Fernández, Fernando; Luque, Emilio (Springer Verlag, 2000)In the distributed processing area, mapping and scheduling are very important issues in order to exploit the gain from parallelization. The generation of efficient static mapping techniques implies a previous modelling ...
Guirado Fernández, Fernando; Roig Mateu, Concepció; Ripoll, A. (Elsevier, 2013)The exploitation of throughput in a parallel application that processes an input data stream is a difficult challenge. For typical coarse-grain applications, where the computation time of tasks is greater than their ...