Distributed synchronization is necessary to coordinate the diverse activities of a distributed system. Priority synchronization is needed for real time systems, or to improve the performance of critical tasks. Practical synchronization techniques require fast response and low overhead. In this paper, we present three priority synchronization algorithms that send O(log n) messages per critical s...

The Internet has billions of web pages and these web pages are attached to each other using URL(Uniform Resource Allocation). Web crawler is a main module of Search engine that gathers these documents from WWW. Most of the web pages present on Internet are active and changes periodically. Thus, Crawler is required to update these web pages to update database of search engine. In this paper, pri...

OBJECTIVES This study describes the views of various stakeholders on the importance of different criteria for priority setting of HIV/AIDS interventions in Indonesia. METHODS Based on a general list of criteria and a focus group discussion with stakeholders (n = 6), a list was developed of thirty-two criteria that play a role in priority setting in HIV/AIDS control in West-Java province. Crit...

We present an efficient and practical lock-free implementation of a concurrent priority queue that is suitable for both fully concurrent (large multiprocessor) systems as well as pre-emptive (multi-process) systems. Many algorithms for concurrent priority queues are based on mutual exclusion. However, mutual exclusion causes blocking which has several drawbacks and degrades the system’s overall...

BACKGROUND Nearly 20,000 patients per year in the UK receive total knee arthroplasty (TKA). One of the problems faced by the health services of many developed countries is the length of time patients spend waiting for elective treatment. We therefore report the results of a study in which the Salisbury Priority Scoring System (SPSS) was used by both the surgeon and their patients to ascertain w...

Grids have emerged as paradigms for the next generation parallel and distributed computing. Computational Grid can be defined as large-scale high-performance distributed computing environments that provide access to high-end computational resources. Grid scheduling is the process of scheduling jobs over grid resources. Improving overall system performance with a lower turn around time is an imp...

Existing concurrent priority queues do not allow to update the priority of an element after its insertion. As a result, algorithms that need this functionality, such as Dijkstra’s single source shortest path algorithm, resort to cumbersome and inefficient workarounds. We report on a heap-based concurrent priority queue which allows to change the priority of an element after its insertion. We sh...

When a real-time system is realized on a shared-memory multiprocessor, priority-ordered spin locks are often required to reduce priority inversions. However, simple priority-ordered spin locks can cause uncontrolled priority inversions when they are used for nested spin locks. This paper points out the problem of uncontrolled priority inversions in the context of spin locks and proposes priorit...

Using priority inheritance protocols is an e ective approach to solve the problem of uncontrolled priority inversion, which is among the major sources of deadline violations in hard real-time systems. In this paper, some approaches to incorporate priority inheritance to the ITRON speci cation are discussed. As the result, we propose two speci cations of priority inheritance semaphore functions ...

BACKGROUND In 2006, researchers and decision-makers launched a five-year project - Response to Accountable Priority Setting for Trust in Health Systems (REACT) - to improve planning and priority-setting through implementing the Accountability for Reasonableness framework in Mbarali District, Tanzania. The objective of this paper is to explore the acceptability of Accountability for Reasonablene...