Compiler techniques for data synchronization in nested parallel loops

1990 ◽  
Author(s):  
Peiyi Tang ◽  
Pen-Chung Yew ◽  
Chuan-Qi Zhu
Keyword(s):  
Data Synchronization ◽  
Parallel Loops ◽  
Compiler Techniques

Compiler techniques for data synchronization in nested parallel loops

1990 ◽  
Vol 18 (3b) ◽  
pp. 177-186 ◽  
Author(s):  
Peiyi Tang ◽  
Pen-Chung Yew ◽  
Chuan-Qi Zhu
Keyword(s):  
Data Synchronization ◽  
Parallel Loops ◽  
Compiler Techniques

A Layered Mapping of Ada 202X to OpenMP

2021 ◽  
Vol 40 (2) ◽  
pp. 55-58
Author(s):  
S. Tucker Taft
Keyword(s):  
Operating System ◽  
Application Programming Interface ◽  
Light Weight ◽  
Main Interest ◽  
Thread Scheduling ◽  
Environment Variables ◽  
Application Programming ◽  
Parallel Loops ◽  
Programming Interface

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.

A New File Updating Discovery Algorithm Supporting Semantic Synchronization

2012 ◽  
Vol 263-266 ◽  
pp. 1979-1986
Author(s):  
Qiang Li ◽  
Li Gu Zhu ◽  
Sai Feng Zeng
Keyword(s):  
File System ◽  
File Systems ◽  
Data Synchronization ◽  
Basic Features ◽  
Short Time

Updates discovery is the key problem of data synchronization; it has been used to generate updates operations. The traditional algorithms ignore the modify semanteme, cause the updates operations increased. A new file updating discovery algorithm that supports semantic synchronization is proposed in this paper. The algorithm takes advantage of semantic info, which preserved in file system journal, to accurately recognize users originally modify intents. We take the NTFS file system as an example to realize and test the new algorithm. By comparison, the algorithm effectively reduces synchronization requests. Experiments show that, the algorithm cans timely respond to users’ modification and support massive file changes that occurred in short time. The algorithm is designed based on the basic features of file system journal, and can be applied to other file systems.

Sign in / Sign up

Export Citation Format

Share Document