Sciweavers

41 search results - page 7 / 9
» Reducing Context Switch Overhead with Compiler-Assisted Thre...
Sort
View
PPOPP
2010
ACM
14 years 11 months ago
Analyzing lock contention in multithreaded applications
Many programs exploit shared-memory parallelism using multithreading. Threaded codes typically use locks to coordinate access to shared data. In many cases, contention for locks r...
Nathan R. Tallent, John M. Mellor-Crummey, Allan P...
OSDI
1994
ACM
15 years 2 months ago
Distributed Filaments: Efficient Fine-Grain Parallelism on a Cluster of Workstations
A fine-grain parallel program is one in which processes are typically small, ranging from a few to a few hundred instructions. Fine-grain parallelism arises naturally in many situ...
Vincent W. Freeh, David K. Lowenthal, Gregory R. A...
ECRTS
2010
IEEE
15 years 2 months ago
Preemption Points Placement for Sporadic Task Sets
Abstract--Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fullypreemptive scheduling when reduced blocking times need to coexist wit...
Marko Bertogna, Giorgio C. Buttazzo, Mauro Marinon...
ISSS
2002
IEEE
133views Hardware» more  ISSS 2002»
15 years 6 months ago
Efficient Simulation of Synthesis-Oriented System Level Designs
Modeling for synthesis and modeling for simulation seem to be two competing goals in the context of C++-based modeling frameworks. One of the reasons is while most hardware system...
Rajesh K. Gupta, Sandeep K. Shukla, Nick Savoiu
USENIX
2003
15 years 2 months ago
Kernel Support for Faster Web Proxies
This paper proposes two mechanisms for reducing the communication-related overheads of Web applications. One mechanism is user-level connection tracking, which allows an applicati...
Marcel-Catalin Rosu, Daniela Rosu