Sciweavers

130 search results - page 7 / 26
» A Parallel Priority Queue with Constant Time Operations
Sort
View
SPDP
1993
IEEE
13 years 11 months ago
How to Share an Object: A Fast Timing-Based Solution
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
Rajeev Alur, Gadi Taubenfeld
HIPC
2005
Springer
14 years 28 days ago
Preemption Adaptivity in Time-Published Queue-Based Spin Locks
Abstract. The proliferation of multiprocessor servers and multithreaded applications has increased the demand for high-performance synchronization. Traditional scheduler-based lock...
Bijun He, William N. Scherer III, Michael L. Scott
EOR
2010
110views more  EOR 2010»
13 years 7 months ago
Pricing surplus server capacity for mean waiting time sensitive customers
Resources including various assets of supply chains, face random demand over time and can be shared by others. We consider an operational setting where a resource is shared by two...
Sudhir K. Sinha, N. Rangaraj, N. Hemachandra
PPOPP
2009
ACM
14 years 8 months ago
Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
Tong Li, Dan P. Baumberger, Scott Hahn
WSC
1994
13 years 8 months ago
General purpose simulation with stroboscope
Stroboscope is a programming language designed for the simulation of processes common to construction engineering. These processes are very complex and involve many different type...
Julio C. Martínez, Photios G. Ioannou