scholarly journals Optimized Execution of Parallel Loops via User-Defined Scheduling Policies

Author(s):  
Seonmyeong Bak ◽  
Yanfei Guo ◽  
Pavan Balaji ◽  
Vivek Sarkar
2021 ◽  
Vol 40 (2) ◽  
pp. 55-58
Author(s):  
S. Tucker Taft

The OpenMP specification defines a set of compiler directives, library routines, and environment variables that together represent the OpenMP Application Programming Interface, and is currently defined for C, C++, and Fortran. The forthcoming version of Ada, currently dubbed Ada 202X, includes lightweight parallelism features, in particular parallel blocks and parallel loops. All versions of Ada, since its inception in 1983, have included "tasking," which corresponds to what are traditionally considered "heavyweight" parallelism features, or simply "concurrency" features. Ada "tasks" typically map to what are called "kernel threads," in that the operating system manages them and schedules them. However, one of the goals of lightweight parallelism is to reduce overhead by doing more of the management outside the kernel of the operating system, using a light-weight-thread (LWT) scheduler. The OpenMP library routines support both levels of threading, but for Ada 202X, the main interest is in making use of OpenMP for its lightweight thread scheduling capabilities.


1995 ◽  
Vol 22 (10-12) ◽  
pp. 247-259 ◽  
Author(s):  
M. Ohnishi ◽  
H. Maeda ◽  
T. Ibaraki

1992 ◽  
Vol 29 (04) ◽  
pp. 957-966 ◽  
Author(s):  
Mark P. Van Oyen ◽  
Dimitrios G. Pandelis ◽  
Demosthenis Teneketzis

We investigate the impact of switching penalties on the nature of optimal scheduling policies for systems of parallel queues without arrivals. We study two types of switching penalties incurred when switching between queues: lump sum costs and time delays. Under the assumption that the service periods of jobs in a given queue possess the same distribution, we derive an index rule that defines an optimal policy. For switching penalties that depend on the particular nodes involved in a switch, we show that although an index rule is not optimal in general, there is an exhaustive service policy that is optimal.


Author(s):  
Chao-Tung Yang ◽  
Shian-Shyong Tseng ◽  
Shih Hung Kao ◽  
Ming-Hui Hsieh ◽  
Mon-Fong Jiang

2016 ◽  
Vol 13 (12) ◽  
pp. 433-449 ◽  
Author(s):  
Anthony J. Carfang ◽  
Eric W. Frew

Sign in / Sign up

Export Citation Format

Share Document