By Topic

Using preemptive access to the critical section in shared memory environment to minimize the execution time of the fork-join structure

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mi-Sook Kim ; Dept. of Comput. Sci., Connecticut Univ., Storrs, CT, USA ; Ammar, R.A.

Under a shared memory environment, processes in a parallel structure communicate with one another by shared variables. Since no two processes should access shared variables simultaneously, they should be placed in the critical section to guarantee mutually exclusive access. The problem is how to order processes competing to access the critical section with the aim of minimizing the time spent to execute these processes. Previously, a heuristic algorithm scheduled these processes without allowing preemption in accessing the critical section. We present another heuristic algorithm with the preemption approach to improve previous results

Published in:

Computers and Communications, 1998. ISCC '98. Proceedings. Third IEEE Symposium on

Date of Conference:

30 Jun-2 Jul 1998