Graph Scaling: A Technique for Automating Program Construction and Deployment in ClusterGOP

  1. Lookup NU author(s)
  2. Dr Yudong Sun
Author(s)Chan F, Cao J, Sun Y
Editor(s)Zhou, X., Jähnichen, S. Xu, M., Cao, J.
Publication type Conference Proceedings (inc. Abstract)
Conference NameAdvanced Parallel Programming Technologies, 5th International Workshop (APPT)
Conference LocationXiamen, China
Year of Conference2003
Source Publication Date17-19 September 2003
Series TitleLecture Notes in Computer Science
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Program development and resource management are critical issues in large-scaled parallel applications and they raise difficulties for the programmers. Automation tools can benefit the programmer by reducing the time and work required for programming, deploying, and managing parallel applications. In our previous work, we have developed a visual tool, VisualGOP, to help visual construction and automatic mapping of parallel programs to execute on the ClusterGOP platform, which provides a graph-oriented model and the environment for running the parallel applications on clusters. In VisualGOP, the programmer needs to manually build the task interaction graph. This may lead to scalability problem for large applications. In this paper, we propose a graph scaling approach that helps the programmer to develop and deploy a large-scale parallel application minimizing the effort of graph construction, task binding and program deployment. The graph scaling algorithms expand or reduce a task graph to match the specified scale of the program and the hardware architecture, e.g., the problem size, the number of processors and interconnection topology, so as to produce an automatic mapping. An example is used to illustrate the proposed approach and how programmer benefits in the automation tools.
ActionsLink to this publication
Library holdingsSearch Newcastle University Library for this item