Correlation of the paging activity of individual node programs in the SPMD execution mode
نویسندگان
چکیده
In this paper we introduce a methodology for the analysis of the paging activity of parallel programs running on massively parallel systems. The methodology includes parallel program monitoring and the analysis of the collected data. We study the correlation of the paging activities of individual node programs in the SPMD execution mode and its effect on scheduling.
منابع مشابه
Characterization of the Paging Activity of NAS Benchmark Programs on the Intel Paragon
In this work, a two prong dynamic paging activity data analysis is considered. The rrskyline analysis" studies how similar/dissimilar is the paging activity oj different node programs in SPMD execution mode. This analysis is done by determining the rate at which different events Deem", by isolating the peaks of activity from the background, and by correlating the time of occurrence and the ampl...
متن کاملA Hybrid Shared Memory Execution Model for a Data Parallel Language with I/O
Execution of programs with data parallel language constructs is either based on the fork/join or on the SPMD model. Whereas the former executes a program sequentially and confines parallel activity to the data parallel constructs, the latter executes the whole program in parallel: while data parallel constructs are performed cooperatively, the remaining code is replicated. However, in the prese...
متن کاملSpmd Execution of Programs with Pointer-based Dynamic Data Structures
This paper discusses an approach for supporting SPMD (single-program, multiple-data) execution of programs with pointer-based data structures on distributed-memory machines. Through a combination of language design and new compilation techniques, static and dynamic implicit parallelism present in sequential programs based upon pointer-based data structures is exploited. Language support is prov...
متن کاملA Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm
In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...
متن کاملOn Gang Scheduling and Demand Paging
Uniprocessor system schedulers hide the high latency of a page fault, by performing a context switch from the process or thread experiencing the fault to another process ready to run. Gang scheduling attempts to schedule all the processes in a process group at the same time. Processes in a process group do not experience page faults at precisely the same time, and process group context switchin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995