Sciweavers

286 search results - page 19 / 58
» Highly Concurrent Shared Storage
Sort
View
RTCSA
2000
IEEE
15 years 3 months ago
Space efficient wait-free buffer sharing in multiprocessor real-time systems based on timing information
A space efficient wait-free algorithm for implementing a shared buffer for real-time multiprocessor systems is presented in this paper. The commonly used method to implement share...
Håkan Sundell, Philippas Tsigas
PE
2007
Springer
97views Optimization» more  PE 2007»
14 years 11 months ago
On processor sharing and its applications to cellular data network provisioning
To develop simple traffic engineering rules for the downlink of a cellular system using Proportional Fairness (PF) scheduling, we study the “strict” and “approximate” ins...
Yujing Wu, Carey L. Williamson, Jingxiang Luo
CLUSTER
2002
IEEE
15 years 4 months ago
Kernel-Level Caching for Optimizing I/O by Exploiting Inter-Application Data Sharing
With applications becoming larger and the increasing load on high performance systems, it is important to tackle the I/O bottleneck problem from several angles. It is not only ess...
Murali Vilayannur, Mahmut T. Kandemir, Anand Sivas...
ASPLOS
2010
ACM
15 years 6 months ago
ConMem: detecting severe concurrency bugs through an effect-oriented approach
Multicore technology is making concurrent programs increasingly pervasive. Unfortunately, it is difficult to deliver reliable concurrent programs, because of the huge and non-det...
Wei Zhang, Chong Sun, Shan Lu
CAV
2006
Springer
165views Hardware» more  CAV 2006»
15 years 3 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...