Reading many variables in one atomic operation solutions with linear or sublinear complexity

2005 ◽  
pp. 229-241 ◽  
Author(s):  
Lefteris M. Kirousis ◽  
Paul Spirakis ◽  
Philippas Tsigas
Keyword(s):  
Atomic Operation

SSSP on GPU Without Atomic Operation

2016 ◽  
pp. 409-419
Author(s):  
Feng Wang ◽  
Liehuang Zhu ◽  
Changyou Zhang
Keyword(s):  
Atomic Operation

Reading many variables in one atomic operation: solutions with linear or sublinear complexity

1994 ◽  
Vol 5 (7) ◽  
pp. 688-696 ◽  
Author(s):  
L.M. Kirousis ◽  
P. Spirakis ◽  
P. Tsigas
Keyword(s):  
Atomic Operation

No transposition in Harmonic Serialism

Phonology ◽  
2019 ◽  
Vol 36 (4) ◽  
pp. 695-726
Author(s):  
Chikako Takahashi
Keyword(s):  
Harmonic Serialism ◽  
Atomic Operation ◽  
Locality Restriction ◽  
Constraint Sets

This paper presents a Harmonic Serialism analysis of synchronic metathesis, and proposes to eliminate transposition as an atomic operation, instead analysing metathesis as a result of the sequential application of simpler operations. The analysis of phase alternations in Rotuman offers a unified account of metathesis, deletion and umlaut as all undergoing splitting followed by fusion. A non-transposition analysis of multiple metathesis in Kwara'ae shows that a prosodically motivated locality restriction on the splitting domain is crucial in deriving the attested patterns. CC metathesis in Balangao is analysed as fusion followed by splitting. Eliminating transposition has several benefits: (a) it simplifies the inventory of operations in Harmonic Serialism, (b) it correctly predicts the locality restrictions on metathesis patterns with smaller constraint sets and (c) it accounts for the differences observed in the segment types involved in CV(VC) vs. CC metathesis.

scholarly journals No Metathesis in Harmonic Serialism

2018 ◽  
Vol 5 ◽  
Author(s):  
Chikako Takahashi
Keyword(s):  
Harmonic Serialism ◽  
Atomic Operation

This paper presents a Harmonic Serialism analysis of synchronic metathesis, proposing to eliminate metathesis as an atomic operation, instead analyzing apparent metathesis cases as a result of the sequential application of simpler operations such as copy + deletion or fusion + fission, and not as segment reordering. The analysis of Rotuman phase alternation in this paper offers a unified account of apparent metathesis, deletion, and umlaut as all going through the processes of copy + deletion and subsequent fusion. Balangao CC metathesis is analyzed as fusion + fission incorporating an idea that CC metathesis is phonetically motivated. Removing the atomic metathesis operation has several benefits: (a) it simplifies the inventory of operations in Harmonic Serialism, (b) it correctly predicts locality restrictions on metathesis patterns without the help of other constraints that are otherwise needed in HS analysis, (c) and it correctly predicts the typological restrictions on the types of segments that undergo CC metathesis.

scholarly journals Communication Coroutines For Parallel Program Using DW26010 Many Core Processor

2021 ◽  
Vol 3 (1) ◽  
pp. 15-20
Author(s):  
Ajit Singh
Keyword(s):  
Parallel Computing ◽  
Communication System ◽  
Information Exchange ◽  
Parallel Programs ◽  
Parallel Program ◽  
Processing Element ◽  
Scheduling System ◽  
Synchronization Mechanism ◽  
Atomic Operation ◽  
Many Core

Communication between parallel programs is an indispensable part of parallel computing. SW26010 is a heterogeneous many-core processor used to build the Sunway Taihu Light supercomputer, which is well suited for parallel computing. There is the designing and implementing a coroutine scheduling system on the SW26010 processor to improve its concurrency, it is very important and necessary to achieve communication between coroutines for the coroutine scheduling system in advance. Therefore, this paper proposes a communication system for data and information exchange between coroutines on SW26010 processor, which contains the following parts. The designing and implementation a producer-consumer mode channel communication based on ring buffer, and it designs synchronization mechanism for condition of multi-producer and multi-consumer based on the different atomic operation on MPE (management processing element) and CPE (computing processing element) of SW26010. There is also the designing of a wake-up mechanism between the producer and the consumer, which reduces the waiting of the program for communication. The testing and analysis of the performance of channel in different numbers of producers and consumers, draw the conclusion that when the number of producers and consumers increases, the channel performance will decrease.

Parallel Shellsort Algorithm for Many-Core GPUs with CUDA

2012 ◽  
Vol 4 (2) ◽  
pp. 1-16 ◽  
Author(s):  
Chun-Yuan Lin ◽  
Wei Sheng Lee ◽  
Chuan Yi Tang
Keyword(s):  
Graphics Processing Units ◽  
Algorithmic Problem ◽  
Radix Sort ◽  
Sorting Algorithms ◽  
Atomic Operation ◽  
Data Elements ◽  
Sample Sort ◽  
Many Core ◽  
Graphics Processing ◽  
Memory Utilization

Sorting is a classic algorithmic problem and its importance has led to the design and implementation of various sorting algorithms on many-core graphics processing units (GPUs). CUDPP Radix sort is the most efficient sorting on GPUs and GPU Sample sort is the best comparison-based sorting. Although the implementations of these algorithms are efficient, they either need an extra space for the data rearrangement or the atomic operation for the acceleration. Sorting applications usually deal with a large amount of data, thus the memory utilization is an important consideration. Furthermore, these sorting algorithms on GPUs without the atomic operation support can result in the performance degradation or fail to work. In this paper, an efficient implementation of a parallel shellsort algorithm, CUDA shellsort, is proposed for many-core GPUs with CUDA. Experimental results show that, on average, the performance of CUDA shellsort is nearly twice faster than GPU quicksort and 37% faster than Thrust mergesort under uniform distribution. Moreover, its performance is the same as GPU sample sort up to 32 million data elements, but only needs a constant space usage. CUDA shellsort is also robust over various data distributions and could be suitable for other many-core architectures.

scholarly journals The Research on Operation Automation Model for Information Equipment

2021 ◽  
Vol 2095 (1) ◽  
pp. 012048
Author(s):  
Danping Li ◽  
Zhiwen Chen ◽  
Guihua Wang ◽  
Xiaolu Zhou ◽  
Ming Ren
Keyword(s):  
High Efficiency ◽  
Military Industry ◽  
Manual Operation ◽  
Adaptive Technology ◽  
High Security ◽  
Operation Process ◽  
Atomic Operation ◽  
Location Change ◽  
Configuration Changes

Abstract Privilege control is an important problem to be solved in the operation of the intranet network of military industry. Solidifying the operation process and replacing the operation personnel with machines to complete configuration changes can reduce the frequency of manual operation by privileged personnel, thus limiting the operation privilege and improving the security of intranet network. Aiming at the high security and high efficiency requirements of operation of intranet information equipment, this paper designs an operation automation mode. Aiming at the problem that it is difficult for tools to adapt to heterogeneous equipment, this paper studies the commands adaptive technology for heterogeneous equipment based on abstract atomic operation. In addition, the model and technologies are verified by a specific scene of equipment location change. The results show that the above model and technologies achieve the goal of ensuring the security of operation and improving the efficiency of operation.

Sign in / Sign up

Export Citation Format

Share Document