Sciweavers

483 search results - page 97 / 97
» Timing Games and Shared Memory
Sort
View
ISSRE
2010
IEEE
13 years 3 months ago
Characterizing Failures in Mobile OSes: A Case Study with Android and Symbian
Abstract—As smart phones grow in popularity, manufacturers are in a race to pack an increasingly rich set of features into these tiny devices. This brings additional complexity i...
Amiya Kumar Maji, Kangli Hao, Salmin Sultana, Saur...
PODC
2011
ACM
12 years 8 months ago
From bounded to unbounded concurrency objects and back
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...
Yehuda Afek, Adam Morrison, Guy Wertheim
CCR
2005
103views more  CCR 2005»
13 years 5 months ago
Part III: routers with very small buffers
Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologie...
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Ni...