We show that for every fixed k, there is a linear time algorithm that decides whether or not a
given graph has a vertex set X of order at most k such that GX is planar (we call this class of …

In software transactional memory (STM) systems, the contention management (CM) policy
decides what action to take when a conflict occurs. CM is crucial to the performance of STM …

Software Transaction Memory (STM) is an alternative synchronization method to the
traditional lock-based schemes. In an STM system, the contention manager (CM) decides …

Software transactional memory (STM) is one of the techniques used towards achieving non-
blocking process synchronization in multi-threaded computing environment. In spite of its …

The objective of this work is to investigate the algorithm design and the programming model
of multi-threaded computing. With the rapid advancement in multi-/many-core processors …

Memórias Transacionais reduzem a possibilidade de erros na programação e a ocorrência
de deadlocks durante a execução em sistemas com múltiplas threads, entretanto, o …

Data access is an essential part of any program, and is especially critical to the performance
of parallel computing systems. The objective of this work is to investigate factors that affect …

Transactional Memory, one of the most viable alternatives to lock based concurrent systems,
was explored by the researchers for practically implementing parallel processing. The goal …