MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Multiple Groups of Parallel Processes Within a Parallel Structure in Shared Memory Environment

Download:
Download as a PDF | Download as a PS
by Reda A. Ammar, Mohamad R. Neilforoshan-dardashti, Tahany A. Fergany
http://viadrina.euv-frankfurt-o.de/~wiwi-inf/wi/icci94/papers/c4.ps
Add To MetaCart

Abstract:

In this paper, we developed an efficient allocation method that utilizes the optimal scheduling algorithms to distribute the available number of processors among different parallel processes within the given parallel structure (FORKJOIN structure). We consider the case of the parallel structure whose parallel processes can be divided into groups, where a group is defined to be a set of parallel but conflicting processes that have to access a set of shared variables. We assumed that the available number of processors is very limited and smaller than the number of groups.

Citations

146 Operating Systems: Design and Implementation – Tanenbaum - 1987
129 On the mapping problem – Bokhari - 1981
30 Allocating Programs Containing Branches and Loops within a Multiple Processor System – Towsley - 1986
25 A Taxonomy of Scheduling in General Purpose Distributed Computing Systems – Casavant, Kuhl - 1988
13 Minimization of interprocessor synchronization in multiprocessors with shared and private memory – Shaffer - 1989
2 Optimizing the time cost of parallel structure by scheduling parallel processes to access the critical section – Neilforoshan-Daradshti, Ammar, et al. - 1992
2 Compile time partitioning and scheduling of parallel programs – Sarkar, Henesy - 1986
1 Efficient execution of Multiple Groups of Parallel Processes within a Parallel Structure with a Limited Number – Ammar, Neilforoshan, et al. - 1993
1 Optimizing the Time Cost of the Parallel Structures with a Limited Number – Fergany, Ammar, et al.
1 Introduction to Parallel Processing – Lewis, El-Rewini - 1992
1 Microtime Cost Analysis of Parallel Computations – Qin, Sholl, et al. - 1991
1 Allocating Processing Power to Minimize the Time Cost – Qin, Sholl, et al.
View or Download | Add to My Collection | Correct Errors