CASS: An efficient task management system for distributed memory architectures

Jing Chiou Liou, M. A. Palis

Research output: Contribution to conferencePaperpeer-review

3 Scopus citations

Abstract

The thesis of this research is that the task of exposing the parallelism in a given application should be left to the algorithm designer, who has intimate knowledge of the application characteristics. On the other hand, the task of limiting the parallelism in a chosen parallel algorithm is best handled by the compiler or operating system for the target MPP machine. Toward this end, we have developed CASS (for Clustering And Scheduling System), a task management system that provides facilities for automatic granularity optimization and task scheduling of parallel programs on distributed memory parallel architectures. Our tool environment, CASS, consists of a two-phase method of compiler-lime scheduling in which task clustering is performed prior to the actual scheduling process. The clustering module identifies the optimal number of processing nodes that the program will require to obtain maximum performance on the target parallel machine. The scheduling module maps the clusters onto a fixed number of processors and determines the order of execution of tasks in each processor.

Original languageEnglish
Pages289-295
Number of pages7
DOIs
StatePublished - 1997
Event3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997 - Taipei, Taiwan, Province of China
Duration: 18 Dec 199720 Dec 1997

Conference

Conference3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997
Country/TerritoryTaiwan, Province of China
CityTaipei
Period18/12/9720/12/97

Fingerprint

Dive into the research topics of 'CASS: An efficient task management system for distributed memory architectures'. Together they form a unique fingerprint.

Cite this