M. Gerndt, Andreas Schmidt, M. Schulz, Roland Wismüller
{"title":"Performance analysis for teraflop computers: a distributed automatic approach","authors":"M. Gerndt, Andreas Schmidt, M. Schulz, Roland Wismüller","doi":"10.1109/EMPDP.2002.994208","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994208","url":null,"abstract":"Performance analysis for applications on teraflop computers requires a new combination of concepts: online processing, automation, and distribution. The article presents the design of a new analysis system that performs an automatic search for performance problems. This search is guided by a specification of performance properties based on the APART Specification Language. The system is being implemented as a network of analysis agents that are arranged in a hierarchy. Higher level agents search for global performance problems while lower level agents search local performance problems. Leaf agents request and receive performance data from the monitoring library linked to the application. Our online analysis also takes into account design patterns for parallel applications. These patterns make the analysis more effective and the output more application-related. The analysis is currently being implemented for the Hitachi SR8000 teraflop computer at the Leibniz-Rechenzentrum in Munich within the Peridot project.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"1 9-10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123743123","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Improving induction decision trees with parallel genetic programming","authors":"G. Folino, C. Pizzuti, G. Spezzano","doi":"10.1109/EMPDP.2002.994264","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994264","url":null,"abstract":"A parallel genetic programming approach to induce decision trees in large data sets is presented. A population of trees is evolved by employing the genetic operators and every individual is evaluated by using a fitness function based on the J-measure. The method is able to deal with large data sets since it uses a parallel implementation of genetic programming through the grid model. Experiments on data sets from the UCI machine learning repository show better results with respect to C5. Furthermore, performance results show a nearly linear speedup.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122434149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
E. Macías, Álvaro Suárez Sarmiento, C. N. Ojeda-Guerra
{"title":"Solving non-smooth unconstrained optimization problem with LAMGAC in a LAN-WLAN grid domain","authors":"E. Macías, Álvaro Suárez Sarmiento, C. N. Ojeda-Guerra","doi":"10.1109/EMPDP.2002.994335","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994335","url":null,"abstract":"Traditionally, a local area network (LAN) has been used for parallel programming with PVM and MPI. The improvement of communications in wireless local area networks (WLANs) achieving up to 11 Mbps make them, according to some authors, candidates to be used as a resource for grid computing. In this paper we use our library based on LAM/MPI named LAMGAC in order to parallelize an algorithm that finds the global minimum of a nonlinear real valued continuous function. The algorithm uses a strategy based on the division of the domain into small boxes and it locates the extreme by means of a multiple start algorithm (MRS). The local minimizer is carried out by means of the steepest descent and the DFP method. The novelty of this approach is that we can vary the parallel virtual machine in runtime (spawning new processes using functions defined in MPI-2), we generate algorithms in which computations and communications are efficiently overlapped and we include a Web interface to offer our system as a grid resource. We have measured the execution time of some algorithms and the components of LAMGAC, obtaining interesting results.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114580940","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A simulation environment for ad hoc networks using sector subdivision","authors":"Klaus Volbert","doi":"10.1109/EMPDP.2002.994324","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994324","url":null,"abstract":"A new model for communication in MANET is presented: Instead of omnidirectional transmissions, as assumed in most papers and all existing systems, the members are allowed to submit data in a fixed number of different directions (sector subdivision) and to adjust the transmission power in each sector separately. A simulation environment (simulation environment for ad hoc networks, SAHNE) is presented that allows simulation of communication strategies in MANET that use sector subdivision, and simulation results are shown where communication paths are selected via hop-minimization or geometric spanner properties. SAHNE is based on C++ and common libraries, which ensures that it can be used on many different platforms. The experiments show the influence of different parameters in realistic scenarios, and using geometric routing seemed to be better than using hop-minimization.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128677441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Execution time prediction for parallel data processing tasks","authors":"S. Juhász, H. Charaf","doi":"10.1109/EMPDP.2002.994210","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994210","url":null,"abstract":"Nowadays a wide range of highly efficient hardware components are available as possible building blocks for parallel distributed systems, however many questions arise on the software side. There is no common solution for optimal distribution of co-operating tasks, and performance prediction is also an open issue. Efforts are focused on creating and making use of mathematical models in a precise domain, namely applications making moderate computation effort on a relatively large amount of data. The possibilities to predict and to minimize execution times are investigated in a cluster of workstations environment, where the data transfer system is expected to become the performance bottleneck. The use of the presented generic model is shown on the example of a parallel integer sorting algorithm: formulas are built up to provide the expected execution times and to approximate the optimal cluster size. Finally, the predicted and the measured execution times of the sorting algorithm are compared for different problem and cluster sizes.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116174326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modular MPI components and the composition of grid applications","authors":"Y. Cotronis","doi":"10.1109/EMPDP.2002.994257","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994257","url":null,"abstract":"The Ensemble methodology supports the design and implementation of message passing applications, particularly MPMD and those demanding irregular or partially regular process topologies. In Ensemble applications are built by composition of modular message passing components. We outline the Ensemble Software Architecture (ESA) and give an overview of the concepts and its supporting tools. We present extensions of ensemble components for composing Grid applications and outline their transformation to pure MPI executables and their execution on MPICH-G2. We demonstrate by building two simple applications, one SPMD and one MPMD where the former SPMD code is reused.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127882594","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Scalable monitoring and configuration tools for grids and clusters","authors":"P. Augerat, Cyrille Martin, B. Stein","doi":"10.1109/EMPDP.2002.994255","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994255","url":null,"abstract":"We present the Ka-admin project that addresses the problem of collecting, visualizing and feeding back any grid information, trace or snapshot, compliant to an XML-like model. Real use includes performance analysis of parallel applications and cluster administration. Ka-admin includes a generic \"filter\" module that processes monitored data independently of what they represent. Filters can remove, aggregate and transform data or pass them to external applications. The end user is responsible for activating the filters from within an interactive graphical interface. This allows him to focus on important information. We also present a \"scatter/gather\" module that allows efficient collection and distribution of data and commands in a large cluster. Early work on \"MPI/threads\" applications and system monitoring tools proved that the combination of both modules matches the objective of a scalable visualization of large data sets.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127949576","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
C. Garino, R. Montero, M. Prieto, I. Llorente, F. Tirado
{"title":"Beowulf performance in CFD multigrid applications","authors":"C. Garino, R. Montero, M. Prieto, I. Llorente, F. Tirado","doi":"10.1109/EMPDP.2002.994206","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994206","url":null,"abstract":"Computational fluid dynamics is probably one of the most computationally demanding disciplines, a driving force behind the development of new computer architectures. In fact, the design and evaluation of high-performance parallel systems is commonly based on CFD workloads. One of the most remarkable examples of such workloads is the NAS parallel benchmark, which aims to mimic the computation and data-movement characteristics of large scale CFD applications. We have paid specific attention to the NAS-MG (multigrid) kernel, since these methods represent one of the most promising solvers in the field of CFD. Nevertheless, practical flow computations demand robust multigrid algorithms which differ from the NAS-MG kernel. The paper presents a performance evaluation of a Beowulf system using both a state-of-the-art multigrid solver and the NAS-MG benchmark. These two codes have been used to compare several of its design choices, namely, the interconnection network (GigaNet versus Fast-Ethernet) as well as the node configuration (dual nodes versus single nodes). The results highlight that the optimal combination strongly depends on the target application.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115921913","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Patricia González, Jose R. Luaces, J. Becerra, R. Duro, I. Lopez
{"title":"Managing distributed resources in the SVG project","authors":"Patricia González, Jose R. Luaces, J. Becerra, R. Duro, I. Lopez","doi":"10.1109/EMPDP.2002.994253","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994253","url":null,"abstract":"The SVG (Superordenador Virtual Galego) is a system developed for the dynamic integration of computationally heterogeneous and geographically distributed nodes connected to the main Galician communications network (RECETGA), so that they can be taken as a single virtual supercomputer. The SVG manages the distribution of jobs among the systems that offer resources, as well as the migration of tasks whenever a computer becomes unavailable or overloaded with local processes. It also keeps track of the global execution of all the tasks it is assigned ensuring at all times that the resources taken up do not compromise the local usage of the shared machines. We describe briefly the SVG architecture and we discuss the implementation of the scheduling scheme designed for managing distributed resources in this platform. We also present encouraging results of a real application running on the SVG.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"456 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132360103","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A JINI framework for distributed service flexibility","authors":"Domenico Cotroneo, C. D. Flora, S. Russo","doi":"10.1109/EMPDP.2002.994244","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994244","url":null,"abstract":"Existing distributed middleware technologies and Enterprise Application frameworks lack in support to service flexibility from both the developer's and user's point of view. In this paper we propose a JINI-based framework, namely PRINCEPS (Pluggable Reliable Infrastructure for Network Computing and Enhanced Properties of Service), which provides a distributed and dynamic environment for flexible service provision. We claim that the adoption of JINI makes it possible to dramatically improve service flexibility by federating services in a dynamic and self-healing networked community. The framework provides the clients with a (web-based) mechanism for selecting services according to functional requirements (i.e., the service interface) and non-functional requirements (the quality of service, i.e., reliability, performance). More implementations of the same service can coexist in the framework, each of one satisfying different non-functional requirements. PRINCEPS provides service substitutability at various levels. In fact, any kind of service can be plugged in PRINCEPS: CORBA-based services, socket-based services, and centralized services. PRINCEPS also supports service developers with its own mechanism to integrate existing services. Preliminary performance experiments and lessons learned from the PRINCEPS prototype are also discussed.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"243 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115000489","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}