Two key synchronization paradigms for the construction of scalable concurrent data-structures are software combining and elimination. Elimination-based concurrent data-structures allow operations with reverse semantics (such as push and pop stack operations) to “collide” and exchange values without having to access a central location. Software combining, on the other hand, is effective when col...

This essay gives an overview of object-oriented aspects and principles in the newly open sourced service framework stack from Ericsson NorARC (Norwegian Applied Research Centre). The framework stack consists of the three layers ServiceFrame [1], ActorFrame [2] and JavaFrame [3], each addressing different challenges facing telecom services and complex concurrent system design in general. These f...

We discuss our findings on how well the Linux 2.4 and 2.5 TCPIP stack scales with multiple network interfaces and with the SMP network workloads on 100/1000 Mb Ethernet networks. We identify three hotspots in the Linux TCPIP stack: 1) inter-processor cache disruption on SMP environments, 2) inefficient copy routines, and 3) poor TCPIP stack scaling as network bandwidth increases. Our analysis s...

Now-a-days leakage power is an important issue in microprocessor’s and hardware’s. In modern computer systems memory components covers 70 to 80 percent of total area of microprocessors that means memory contains more number of transistors. Generally leakage power dissipation proportional to the number of transistors. So the leakage power dissipation is more in the memories. In high performance ...

We investigate the performance of a stack algorithm to decode binary Reed-Muller codes. As metric to evaluate the different elements in the stack we use a recently derived lower bound on the squared Euclidean distance. Similar to the A -algorithm the new metric comprises a lower bound on the increase of the squared Euclidean distance in future decoding steps. Simulation results show that in cas...

We define an algorithmic paradigm, the stack model, that captures many primal dual and local ratio algorithms for approximating covering and packing problems. The stack model is defined syntactically and without any complexity limitations and hence our approximation bounds are independent of the P vs NP question. Using the stack model, we bound the performance of a broad class of primal dual an...

This thesis considers the problem of automatic file migration. In a computer system, program and data files are stored on secondary memory such as discs. If the capacity of the secondary memory is not sufficient to hold all the files, some sort of backup memory (e .g. magnetic tape) is used to supplement secondary storage. The transfer of files between secondary and backup storage is refered to...

The Stack Resource Policy (SRP) is a resource allocation policy which permits processes with different priorities to share a single runtime stack. It is a refinement of the Priority Ceiling Protocol (PCP) of Sha, Rajkumar and Lehoczky, which strictly bounds priority inversion and permits simple schedulability tests. With or without stack sharing, the SRP offers improvements over the PCP, by: (1...