## Abstract For applications such as video games and virtual walkβthroughs, onβline locomotion control is an important issue. In general, the user prescribes a sequence of motions one by one while providing an input trajectory. Since the input trajectory lacks in human characteristics, one may not
Falcon: On-line monitoring for steering parallel programs
β Scribed by Gu, Weiming; Eisenhauer, Greg; Schwan, Karsten; Vetter, Jeffrey
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 304 KB
- Volume
- 10
- Category
- Article
- ISSN
- 1040-3108
No coin nor oath required. For personal study only.
β¦ Synopsis
Advances in high performance computing, communications and user interfaces enable developers to construct increasingly interactive high performance applications. The Falcon system presented in this paper supports such interactivity by providing runtime libraries, tools and user interfaces that permit the on-line monitoring and steering of large-scale parallel codes. The principal aspects of Falcon described in this paper are its abstractions and tools for capture and analysis of application-specific program information, performed on-line, with controlled latencies and scalable to parallel machines of substantial size. In addition, Falcon provides support for the on-line graphical display of monitoring information, and it allows programs to be steered during their execution, by human users or algorithmically. This paper presents our basic research motivation, outlines the Falcon system's functionality, and includes a detailed evaluation of its performance characteristics in light of its principal contributions. Falcon's functionality and performance evaluation are driven by our experiences with large-scale parallel applications being developed with end users in physics and in atmospheric sciences. The sample application highlighted in this paper is a molecular dynamics simulation program (MD) used by physicists to study the statistical mechanics of liquids.
π SIMILAR VOLUMES
This paper addresses the non-preemptive on-line scheduling of parallel jobs. In particular we assume that the release dates and the processing times of the jobs are unknown. It is already known that for this problem Garey and Graham's list scheduling algorithm achieves the competitive factor 2 -1 m