Abstract
The mapping of parallel applications constitutes a difficult problem for which very few practical tools are available. AMEEDA has been developed in order to overcome the lack of a general-purpose mapping tool. The automatic services provided in AMEEDA include instrumentation facilities, parameter extraction modules and mapping strategies. With all these services, and a novel graph formalism called TTIG, users can apply different mapping strategies to the corresponding application through an easy-to-use GUI, and run the application on a PVM cluster using the desired mapping.
This work was supported by the MCyT under contract 2001-2592 and partially sponsored by the Generalitat de Catalunya (G. de Rec. Consolidat 2001SGR-00218).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Subhlok J. and Vongran G.: Optimal Use of Mixed Task and Data Parallelism for Pipelined Computations. J. Par. Distr. Computing. vol. 60. pp 297–319. 2000.
Norman M.G. and Thanisch P.: Models of Machines and Computation for Mapping in Multicomputers. ACM Computing Surveys, 25(3). pp 263–302. 1993.
Roig C., Ripoll A., Senar M.A., Guirado F. and Luque E.: A New Model for Static Mapping of Parallel Applications with Task and Data Parallelism. IEEE Proc. of IPDPS-2002 Conf. ISBN: 0-7695-1573-8. Apr. 2002.
Ahmad I. and Kwok Y-K.: CASCH: A Tool for Computer-Aided Scheduling. IEEE Concurrency. pp 21–33. oct-dec. 2000.
Decker T. and Diekmann R.: Mapping of Coarse-Grained Applications onto Workstation Clusters. IEEE Proc. of PDP’97. pp 5–12. 1997.
Fernandez E.B. and Bussel B.: Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedule. IEEE Tr. on Computers. pp 299–305. Aug. 1973.
Senar M. A., Ripoll A., Cortés A. and Luque E.: Clustering and Reassignment-base Mapping Strategy for Message-Passing Architectures. Int. Par. Proc Symp&Sym. On Par. Dist. Proc. (IPPS/SPDP 98) 415–421. IEEE CS Press USA, 1998.
Hwang J-J., Chow Y-C., Anger F. and Lee C-Y.: Scheduling Precedence Graphs in Systems with Interprocessor Communication Times. SIAM J. Comput. pp: 244–257, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yuan, X., Roig, C., Ripoll, A., Senar, M.A., Guirado, F., Luque, E. (2002). AMEEDA: A General-Purpose Mapping Tool for Parallel Applications on Dedicated Clusters. In: Monien, B., Feldmann, R. (eds) Euro-Par 2002 Parallel Processing. Euro-Par 2002. Lecture Notes in Computer Science, vol 2400. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45706-2_32
Download citation
DOI: https://doi.org/10.1007/3-540-45706-2_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44049-9
Online ISBN: 978-3-540-45706-0
eBook Packages: Springer Book Archive