[PDF][PDF] {FlexSC}: Flexible system call scheduling with {Exception-Less} system calls

L Soares, M Stumm - 9th USENIX Symposium on Operating Systems …, 2010 - usenix.org
For the past 30+ years, system calls have been the de facto interface used by applications to
request services from the operating system kernel. System calls have almost universally …

Run-time modeling and estimation of operating system power consumption

T Li, LK John - Proceedings of the 2003 ACM SIGMETRICS …, 2003 - dl.acm.org
The increasing constraints on power consumption in many computing systems point to the
need for power modeling and estimation for all components of a system. The Operating …

Computation spreading: Employing hardware migration to specialize CMP cores on-the-fly

K Chakraborty, PM Wells, GS Sohi - ACM SIGOPS Operating Systems …, 2006 - dl.acm.org
In canonical parallel processing, the operating system (OS) assigns a processing core to a
single thread from a multithreaded server application. Since different threads from the same …

Rapid identification of architectural bottlenecks via precise event counting

J Demme, S Sethumadhavan - Proceedings of the 38th annual …, 2011 - dl.acm.org
On-chip performance counters play a vital role in computer architecture research due to their
ability to quickly provide insights into application behaviors that are time consuming to …

How Java programs interact with virtual machines at the microarchitectural level

L Eeckhout, A Georges, K De Bosschere - Proceedings of the 18th …, 2003 - dl.acm.org
Java workloads are becoming increasingly prominent on various platforms ranging from
embedded systems, over general-purpose computers to high-end servers. Understanding …

HMTT: a platform independent full-system memory trace monitoring system

Y Bao, M Chen, Y Ruan, L Liu, J Fan, Q Yuan… - Proceedings of the …, 2008 - dl.acm.org
Memory trace analysis is an important technology for architecture research, system software
(ie, OS, compiler) optimization, and application performance improvements. Many …

Acyclic partitioning of large directed acyclic graphs

J Herrmann, J Kho, B Uçar, K Kaya… - 2017 17th IEEE/ACM …, 2017 - ieeexplore.ieee.org
Finding a good partition of a computational directed acyclic graph associated with an
algorithm can help find an execution pattern improving data locality, conduct an analysis of …

Understanding scheduling replay schemes

I Kim, MH Lipasti - 10th International Symposium on High …, 2004 - ieeexplore.ieee.org
Modern microprocessors adopt speculative scheduling techniques where instructions are
scheduled several clock cycles before they actually execute. Due to this scheduling delay …

Coordinate memory deduplication and partition for improving performance in cloud computing

G Jia, G Han, JJPC Rodrigues… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
Both limited main memory size and memory interference are considered as the major
bottlenecks in virtualization environments. Memory deduplication, detecting pages with …

Dynamic resource partitioning for heterogeneous multi-core-based cloud computing in smart cities

G Jia, G Han, J Jiang, N Sun, K Wang - Ieee Access, 2015 - ieeexplore.ieee.org
As the smart cities emerged for more comfortable urban spaces, services, such as health,
transportation, and so on, need to be promoted. In addition, the cloud computing provides …