Heuristic Scheduling Algorithms to Access the Critical Section in Shared Memory Environment

Abstract

In shared memory parallel processing environment, shared variables facilitate communication among processes. To protect shared variables from concurrent access by more than one process at a time, they placed in a critical section. Scheduling a set of parallel processes to access this critical section with the aim of minimizing the time spent to execute these processes is a crucial problem in parallel processing. This paper presents heuristic scheduling algorithms to access this critical section.

11 Figures and Tables

Cite this paper

@inproceedings{AmmarHeuristicSA, title={Heuristic Scheduling Algorithms to Access the Critical Section in Shared Memory Environment}, author={Reda A. Ammar and Tahany A. Fergany and Ali I. El-Desouky and Mohamed M. Hefeeda} }