{"title":"A framework for mapping with resource co-allocation in heterogeneous computing systems","authors":"Ammar H. Alhusaini, V. Prasanna, C. Raghavendra","doi":"10.1109/HCW.2000.843751","DOIUrl":"https://doi.org/10.1109/HCW.2000.843751","url":null,"abstract":"In heterogeneous computing systems, an application often requires multiple resources of different types to be allocated simultaneously. This is the resource co-allocation problem. We develop a framework for mapping a collection of applications with resource co-allocation requirements. In our framework, application tasks have two types of constraints to be satisfied: precedence constraints and resource-sharing constraints. We use a graph theoretic framework to capture these constraints. A directed acyclic graph is used to represent precedence constraints of tasks within an application and a compatibility graph is used to represent resource-sharing constraints among tasks of applications. Both these graphs are used to find maximal independent sets of tasks that can be executed concurrently. The objective of the mapping is to minimize the overall schedule length for a given set of applications. We develop heuristic algorithms to solve the mapping problem with resource co-allocation constraints. We also provide a two-phase algorithm that can be used for run-time adaptation. We conducted simulation experiments to evaluate the performance of our heuristic algorithms. Simulation results for our algorithms show a performance improvement of 10% to 30% over a baseline algorithm of list scheduling which considers only the precedence constraints and allocates tasks from the resulting order. This paper demonstrates the importance of considering the co-allocation requirements when mapping applications in heterogeneous computing environments including grid environments.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126806591","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}
R. Baraglia, D. Laforenza, A. Keller, A. Reinefeld
{"title":"RsdEditor: a graphical user interface for specifying metacomputer components","authors":"R. Baraglia, D. Laforenza, A. Keller, A. Reinefeld","doi":"10.1109/HCW.2000.843756","DOIUrl":"https://doi.org/10.1109/HCW.2000.843756","url":null,"abstract":"RsdEditor is a graphical user interface which produces specifications of computational resources. It is used in the RSD (Resource and Service Description) environment for specifying, registering, requesting and accessing resources and services in a metacomputer. RsdEditor was designed to be used by the administrators and users of metacomputing environments. At the administrator level, the GUI is used to describe the available computing and networking components of a metacomputer. At the user level, RsdEditor can be used to specify which characteristics of the computational resources are needed to execute a meta-application. This paper is organized as follows: it first introduces RsdEditor. It then briefly describes the RSD environment, and finally, it highlights various features and implementation issues of RsdEditor.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122904020","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":"Heterogeneous resource management for dynamic real-time systems","authors":"E. Huh, L. Welch, B. Shirazi, C. Cavanaugh","doi":"10.1109/HCW.2000.843752","DOIUrl":"https://doi.org/10.1109/HCW.2000.843752","url":null,"abstract":"Dynamic real-time systems face many resource management problems. This paper addresses the following problems: (1) dynamic resource allocation to provide QoS objectives, (2) heterogeneous resources, and (3) non-intrusive accurate monitoring of QoS, resource availability and resource needs. This paper describes the techniques of a resource manager handling the above problems to support the QoS of dynamic distributed real-time systems. The contributions of this paper to solve these problems are as follows: unification of dynamic resource requirements among heterogeneous hosts, control of resources in heterogeneous environments, feasibility analysis and dynamic load balancing/sharing. Our heuristic allocation scheme not only allows higher workloads than the random, round-robin and least-load schemes by 257%, 142% and 36.4%, respectively, but it also improves the QoS compared to those schemes by 38.6%, 28.5% and 31.6%, respectively.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126311343","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}
H. Dail, Graziano Obertelli, F. Berman, R. Wolski, A. Grimshaw
{"title":"Application-aware scheduling of a magnetohydrodynamics application in the Legion metasystem","authors":"H. Dail, Graziano Obertelli, F. Berman, R. Wolski, A. Grimshaw","doi":"10.1109/HCW.2000.843746","DOIUrl":"https://doi.org/10.1109/HCW.2000.843746","url":null,"abstract":"Computational grids have become an important and popular computing platform for both scientific and commercial distributed computing communities. However, users of such systems typically find achievement of application execution performance remains challenging. Although grid infrastructures such as Legion and Globus provide basic resource selection functionality, work allocation functionality, and scheduling mechanisms, applications must interpret system performance information in terms of their own requirements in order to develop performance-efficient schedules. We describe a new high-performance scheduler that incorporates dynamic system information, application requirements, and a detailed performance model in order to create performance efficient schedules. While the scheduler is designed to provide improved performance for a magneto-hydrodynamics simulation in the Legion Computational Grid infrastructure, the design is generalizable to other systems and other data-parallel iterative codes. We describe the adaptive performance model, resource selection strategies, and scheduling policies employed by the scheduler. We demonstrate the improvement in application performance achieved by the scheduler in dedicated and shared Legion environments.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"166 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116596959","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":"Evaluation of expanded heuristics in a heterogeneous distributed data staging network","authors":"M. Theys, N. Beck, H. Siegel, M. Jurczyk","doi":"10.1109/HCW.2000.843734","DOIUrl":"https://doi.org/10.1109/HCW.2000.843734","url":null,"abstract":"Providing up-to-date input to users' applications is an important data management problem for a heterogeneous distributed computing environment, where each data storage location and intermediate node may have different data available, different storage limitations and different communication links available. Sites in the heterogeneous network request data items, and each request has an associated deadline and priority. In a military situation, the data staging problem involves positioning data for facilitating a faster access time when it is needed by programs that will aid in decision making. This work concentrates on solving a basic version of the data-staging problem in which all parameter values for the communication system and the data-request information represent the best-known information collected so far, and they stay fixed throughout the scheduling process. The heterogeneous network is assumed to be over-subscribed, and not all requests for data items can be satisfied. Three multiple-source, shortest-path algorithm-based procedures for finding a near-optimal schedule of the communication steps for staging the data are described. Each procedure can be used with each of three cost criteria developed in this paper (based on results from earlier experiments). A subset of the possible procedure/cost criterion combinations are evaluated in simulation studies considering different priority weighting schemes, different average numbers of links used to satisfy each data request, and different network loadings. The proposed heuristics are shown to perform well with respect to upper and lower bounds.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123500110","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":"Scheduling multi-component applications in heterogeneous wide-area networks","authors":"J. Weissman","doi":"10.1109/HCW.2000.843745","DOIUrl":"https://doi.org/10.1109/HCW.2000.843745","url":null,"abstract":"We present a scalable scheduling heuristic for several common classes of multi-component applications (meta-applications). We consider this scheduling problem in a wide-area heterogeneous computing environment, or metasystem. The heterogeneity and scale of the computing environment and the heterogeneity of the application make this a challenging problem. We have studied the performance of the heuristic in simulation and the results are encouraging. Completion times for three common classes of meta-applications were within 10-20% of optimal on average with a worst-case variance of 60%. The results suggest that effective scheduling of meta-applications is possible, if sufficient application and system resource cost information is provided.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121349620","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":"New cost metrics for iterative task assignment algorithms in heterogeneous computing systems","authors":"Raju D. Venkataramana, N. Ranganathan","doi":"10.1109/HCW.2000.843741","DOIUrl":"https://doi.org/10.1109/HCW.2000.843741","url":null,"abstract":"Task assignment and scheduling algorithms for heterogeneous computing systems can be classified as iterative and non-iterative techniques, and are designed to optimize a specific cost function defined on the system. The quality of the solutions generated is controlled by the nature of this cost metric. The common metrics that are used include minimizing the overall execution time or minimizing the load on the maximum loaded processor. In this work, a new set of cost metrics have been proposed that can be used by iterative task assignment algorithms. These metrics exploit the fact that in iterative algorithms the mapping of the subtasks to the processors is known at every iteration. They reflect the actual scheduling cost of the application, thereby improving the quality of the solutions generated by the algorithm. The proposed metrics are evaluated using a learning automata based iterative algorithm. Observations are made regarding the nature of the metrics from the results obtained.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115844499","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}
H. Casanova, Arnaud Legrand, D. Zagorodnov, F. Berman
{"title":"Heuristics for scheduling parameter sweep applications in grid environments","authors":"H. Casanova, Arnaud Legrand, D. Zagorodnov, F. Berman","doi":"10.1109/HCW.2000.843757","DOIUrl":"https://doi.org/10.1109/HCW.2000.843757","url":null,"abstract":"The computational grid provides a promising platform for the efficient execution of parameter sweep applications over very large parameter spaces. Scheduling such applications is challenging because target resources are heterogeneous, because their load and availability varies dynamically, and because independent tasks may share common data files. We propose an adaptive scheduling algorithm for parameter sweep applications on the grid. We modify standard heuristics for task/host assignment in perfectly predictable environments (max-min, min-min, Sufferage), and we propose an extension of Sufferage called XSufferage. Using simulation, we demonstrate that XSufferage can take advantage of file sharing to achieve better performance than the other heuristics. We also study the impact of inaccurate performance prediction on scheduling. Our study shows that: different heuristics behave differently when predictions are inaccurate; and an increased adaptivity leads to better performance.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126790367","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":"Evaluation of PAMS' adaptive management services","authors":"Yoonhee Kim, S. Hariri, Muhamad Djunaedi","doi":"10.1109/HCW.2000.843732","DOIUrl":"https://doi.org/10.1109/HCW.2000.843732","url":null,"abstract":"The management of large-scale parallel and distributed applications is complex, due to factors such as centralized management architectures, lack of coordination and compatibility among heterogeneous network management systems, the dynamic characteristics of networks and application bandwidth requirements. The development of an integrated network management framework that is proactive, scalable and robust is a challenging problem. We present our approach to implement a Proactive Application Management System (PAMS). The architecture consists of two main modules: Application-Centric Management (ACM) and the Management Computing System (MCS). The ACM module provides the application developers with all the tools required to specify the appropriate management schemes to manage any QoS requirement or application attribute/functionality. The MCS provides the core management services to enable the efficient proactive management of a wide range of network applications. The services offered by the MCS are implemented using mobile agents. Furthermore, each MCS service can be implemented using several techniques that can be selected dynamically by invoking the corresponding mobile agent template for the service implementation. We present our preliminary results of evaluating PAMS management services to manage the performance and fault-tolerant execution of three applications of different sizes. The experimental results demonstrate that our agent-based approach can lead to significant gains in the performance and low-overhead fault management of parallel/distributed applications.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134012368","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. Doncker, Rodger Zanny, M. Ciobanu, Yuqiang Guan
{"title":"Distributed quasi-Monte Carlo methods in a heterogeneous environment","authors":"E. Doncker, Rodger Zanny, M. Ciobanu, Yuqiang Guan","doi":"10.1109/HCW.2000.843744","DOIUrl":"https://doi.org/10.1109/HCW.2000.843744","url":null,"abstract":"We present an asynchronous quasi-Monte Carlo (QMC) algorithm for numerical integration tailored for heterogeneous environments. QMC techniques are better suited for high dimensions than adaptive methods and have generally better convergence properties than classical Monte Carlo methods. The algorithm focuses on the asynchronous computation of randomized lattice (Korobov) rules. Whereas the individual rules disallow realistic error estimates, randomization provides a tool for giving confidence intervals for the magnitude of the error. The algorithm generates a sequence of stochastic families, using an increasing number of points, for the purpose of automatic termination. In the algorithm, each each randomized rule constitutes a single unit of work; a work assignment consists of a set of work units. Static and dynamic load balancing strategies are explored to keep the processors busy performing useful work while gradually calculating higher-level families needed to reach the desired accuracy. We present results in the context of a performance model for parallel programs executing in a heterogeneous environment.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115196152","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}