Tahany A. Fergany

Learn More
This paper address the problem of static task clustering and scheduling of a parallel program given as a Directed Acyclic Graph(DAG) with duplication. Scheduling of task graphs onto multiprocessors is known to be an NP-complete in most cases leading to solutions based on heuristics [1]. In this paper, a novel task-duplication scheduling heuristic is(More)
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(More)