This paper proposes a new lock-based concurrent binary tree using a methodology for writing concurrent data structures. This methodology limits the high contention induced by today’s multicore environments to come up with efficient alternatives to the most widely used search structures. Data structures are generally constrained to guarantee a big-oh step complexity even in the presence of concu...

Task scheduling is an essential aspect of parallel process system. Most heuristics for this NP-hard problem assume fully connected homogeneous processors and ignore contention on the communication links. Actually, contention for communication resources has a strong influence on the execution time of a parallel program in arbitrary network topology heterogeneous system. This paper investigates t...

This paper describes some methods for contention resolution in bulk flow TCP routing in optical IP network through simulation. The various domains such as wavelength, time and space with respect to bulk flow TCP to resolve contention are studied. The results show that the flow based transmission under wavelength domain exhibits only the probability of contention is 27%. At the same time, the co...

Many concurrent data-structure implementations – both blocking and non-blocking – use the well-known compare-and-swap (CAS) operation, supported in hardware by most modern multiprocessor architectures, for inter-thread synchronization. A key weakness of the CAS operation is its performance in the presence of memory contention. When multiple threads concurrently attempt to apply CAS operations t...