Sciweavers

ASPLOS
2012
ACM
12 years 23 days ago
Scalable address spaces using RCU balanced trees
Software developers commonly exploit multicore processors by building multithreaded software in which all threads of an application share a single address space. This shared addre...
Austin T. Clements, M. Frans Kaashoek, Nickolai Ze...
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 5 months ago
FIFO anomaly is unbounded
Abstract. Virtual memory of computers is usually implemented by demand paging. For some page replacement algorithms the number of page faults may increase as the number of page fra...
Peter Fornai, Antal Iványi
CCGRID
2001
IEEE
13 years 8 months ago
An Efficient Lock Protocol for Home-Based Lazy Release Consistency
Home-based Lazy Release Consistency (HLRC) shows poor performance on lock based applications because of two reasons: (1) a whole page is fetched on a page fault while actual modif...
Hee-Chul Yun, Sang-Kwon Lee, Joonwon Lee, Seungryo...
SPAA
1996
ACM
13 years 9 months ago
An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...
Robert D. Blumofe, Matteo Frigo, Christopher F. Jo...
RTCSA
2008
IEEE
13 years 11 months ago
Scheduler-Assisted Prefetching: Efficient Demand Paging for Embedded Systems
In an attempt to substitute NOR flash with NAND flash and provide more memory to applications, embedded systems have to use demand paging. However, demand paging drastically degra...
Stanislav A. Belogolov, Jiyong Park, Jungkeun Park...
WOSP
2010
ACM
13 years 12 months ago
A page fault equation for dynamic heap sizing
For garbage-collected applications, dynamically-allocated objects are contained in a heap. Programmer productivity improves significantly if there is a garbage collector to autom...
Y. C. Tay, X. R. Zong