This paper presents an extended version of our previous work on using compiler technology
to automatically convert sequential C++ data abstractions, for example, queues, stacks …

Writing correct and efficient parallel programs is an unavoidable challenge; the challenge
becomes arduous with lock-free programming. This paper presents an automated approach …

This paper investigates using compiler technology to automatically convert sequential C++
data abstractions, eg, queues, stacks, maps, and trees, to concurrent lock-free …

ABSTRACT A serious problem in mining data bases is that they are often incomplete, and a
significant amount of data is missing, or erroneously entered. Missing data occur in almost …

Embedded systems show a tendency of migrating to multicore processors. However, to fully
use the potential of multicore processors, it is necessary to partition software into threads …

This research proposes to implement transmogrification process in the Imputation
procedures to overcome the challenges in missing values. Appropriate data pre-processing …

Automating the Exchangeability of Shared Data Abstractions | SpringerLink Skip to main content
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your research …

This paper introduces a lock-free version of a Pairing heap. Dijkstra's algorithm is a search
algorithm to solve the singlesource shortest path problem. The efficiency of Dijkstra's …

Many programs have a fixed directed graph structure in the way they are processed. In
particular, computer vision systems often employ this kind of pipe-and-filter structure. It is …

In the paper Thread Scheduling for Multiprogrammed Multiprocessors, Arora, Blumofe, and
Paxton (ABP) implement a work-stealing algorithm using a double-ended queue (or deque) …