No abstract

SUMMARYGOP is a graph-oriented programming model which aims at providing high-level abstractions for configuring and programming cooperative parallel processes. With GOP, the programmer can configure the logical structure of a parallel/distributed program by constructing a logical graph to represent the communication and synchronization between the local programs in a distributed processing environment. This paper describes a visual programming environment, called VisualGOP, for the design, coding, and execution of GOP programs. VisualGOP applies visual techniques to provide the programmer with automated and intelligent assistance throughout the program design and construction process. It provides a graphical interface with support for interactive graph drawing and editing, visual programming functions and automation facilities for program mapping and execution. VisualGOP is a generic programming environment independent of programming languages and platforms. GOP programs constructed under VisualGOP can run in heterogeneous parallel/distributed systems.

Abstract. Program developmenta nd resource managementa re critical issues in large-scaled parallel applications and they raise diffi culties 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 avisual tool, VisualGOP,tohelp visual construction and automatic mapping of parallel programs to execute on the ClusterGOP platform, which provides ag raph-oriented model and the environmentf or running the parallel applications on clusters. In VisualGOP,t he programmer needs to manually build the task interaction graph. This maylead to scalability problem for large applications. In this paper, we propose ag raph scaling approacht hat helps the programmer to develop and deployal arge-scale parallel application minimizing the e ff ort of graph construction, task binding and program deployment. The graph scaling algorithms expand or reduce at ask graph to matcht he specified scale of the program and the hardware architecture, e.g., the problem size, the number of processors and interconnection topology,s oa st op roduce an automatic mapping. An example is used to illustrate the proposed approacha nd how programmer benefits in the automation tools. 1I ntroductionProgramming with parallel applications is ad i ffi cult task involving programming details, processors information and network configurations. Am ethodt o simplify parallel program developmenti st oa bstract and representt he parallel programming structure by logical graphs.Task graph is ag raphical representation of ap arallel program. It describes the logical structure of the program in whicht he nodes representt he computational tasks and the edges denote the communication links and precedence relationships among the nodes. Varieties of task graph have been proposed. Directed acyclic graph (DAG) [ 1,2] and task interaction graph (TIG) [3,4]

This paper reports a field study of RSP control for an indoor office environment. The results are directly applicable to building service engineering in the design of ventilation systems using air-handling units. Field observations indicated that indoor RSP in an office environment could be suppressed below 20 microg/m3 within 1 h by the simultaneous filtration of outdoor air and return air. Outdoor air filtration has a great influence on the steady state indoor concentration and return air filtration governs the cleaning rate. It is believed that the results of this study could be extended to the cleaning of other indoor pollutants such as volatile organic compounds.

No abstract