Priority queues are fundamental in the design of modern multiprocessor algorithms. Priority queues with parallel access are an attractive data structure for applications like prioritized online scheduling, discrete event simulation, or branch-and-bound. This paper proposes an alternative approach: to base the design of concurrent priority queues on the Modified Skip List data structure. To this...

Since the end of the 1980’s, the development of self-driven autonomous vehicles is an intensive research area in most major industrial countries. Positive socio-economic potential impacts include a decrease of crashes, a reduction of travel times, energy efficiency improvements, and a reduced need of costly physical infrastructure. Some form of vehicle-to-vehicle and/or vehicle-to-infrastructur...

Tree structures are very often used data structures. Among ordered types of trees there are many variants whose basic operations such as insert, delete, search, delete-min are characterized by logarithmic time complexity. In the article I am going to present the structure whose time complexity for each of the above operations is O( K + K), where M is the size of data type and K is constant prop...

JPEG-2000, the successor to JPEG, is emerging as an attractive candidate for the future de facto image compression standard. However, while it offers superior results over most other image compression techniques, it comes with a long list of features and options, and consequently a highly complex algorithm. We have developed an image coder that can compete with the performance of JPEG-2000 whil...

The present study intended to determine the priority areas for nature-based tourism in Isfahan province, Iran. Considering the components in question, this study was applied-developmental in nature and its methodology was descriptive-survey based on a systematic analysis of the potentials utilization, potential assessment and identification of priority areas and their combination. To carry out ...

A priority queue transforms an input sequence ~r into an output sequence r which is a re-ordering of the sequence ~r. The set R of all such related pairs is studied in the case that tr is a binary sequence. It is proved that R is a partial order and that IRI = c,~+1, the (n + 1)th Catalan number, An efficient (O(n2)) algorithm is given for computing the number of outputs achievable from a given...

Due to resource sharing among tasks, priority inversion can occur during prioritydriven preemptive scheduling. In this work, we investigate solutions to the priority inversion problem in a real-time database environment where two-phase locking is employed for concurrency control. We examine two basic schemes for addressing the priority inversion problem, one based on priority inheritance and th...

Priority-based dynamic carrier allocation strategies can be classified into three categories: static-priority, dynamicpriority, and hybrid-priority strategies. Strategies based on static priorities do not consider the local carrier reuse conditions, while dynamic-priority strategies do take these conditions into consideration. Intuitively, one would expect dynamic-priority strategies to perform...

University of Southern Denmark 38.1 The Cache-Oblivious Model . . . . . . . . . . . . . . . . . . . . . . . . . 38-1 38.2 Fundamental Primitives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38-3 Van Emde Boas Layout • k-Merger 38.3 Dynamic B-Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38-8 Density Based • Exponential Tree Based 38.4 Priority ...