Sciweavers

661 search results - page 91 / 133
» Bandwidth Sharing: Objectives and Algorithms
Sort
View
LCPC
2007
Springer
15 years 3 months ago
Supporting Huge Address Spaces in a Virtual Machine for Java on a Cluster
Abstract. To solve problems that require far more memory than a single machine can supply, data can be swapped to disk in some manner, it can be compressed, and/or the memory of mu...
Ronald Veldema, Michael Philippsen
FM
2009
Springer
169views Formal Methods» more  FM 2009»
15 years 1 months ago
Model Checking Linearizability via Refinement
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...
Yang Liu 0003, Wei Chen, Yanhong A. Liu, Jun Sun 0...
PLDI
2012
ACM
13 years 6 days ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
HPCA
2008
IEEE
15 years 10 months ago
Gaining insights into multicore cache partitioning: Bridging the gap between simulation and real systems
Cache partitioning and sharing is critical to the effective utilization of multicore processors. However, almost all existing studies have been evaluated by simulation that often ...
Jiang Lin, Qingda Lu, Xiaoning Ding, Zhao Zhang, X...
PERCOM
2004
ACM
15 years 9 months ago
An Augmented Virtual Reality Interface for Assistive Monitoring of Smart Spaces
Large sensor networks in applications such as surveillance and virtual classrooms, have to deal with the explosion of sensor information. Coherent presentation of data coming from...
Shichao Ou, Deepak R. Karuppiah, Andrew H. Fagg, E...