Sciweavers

254 search results - page 19 / 51
» CPU Inheritance Scheduling
Sort
View
ICDE
2005
IEEE
131views Database» more  ICDE 2005»
15 years 10 months ago
Improving Preemptive Prioritization via Statistical Characterization of OLTP Locking
OLTP and transactional workloads are increasingly common in computer systems, ranging from ecommerce to warehousing to inventory management. It is valuable to provide priority sch...
David T. McWherter, Bianca Schroeder, Anastassia A...
PPOPP
2009
ACM
15 years 10 months ago
Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
Tong Li, Dan P. Baumberger, Scott Hahn
BSDCON
2003
14 years 10 months ago
Building a High-performance Computing Cluster Using FreeBSD
In this paper we discuss the design and implementation of Fellowship, a 300+ CPU, general use computing cluster based on FreeBSD. We address the design features including configu...
Brooks Davis, Michael AuYeung, Gary Green, Craig A...
RTSS
1999
IEEE
15 years 1 months ago
Deriving Deadlines and Periods for Real-Time Update Transactions
Typically, temporal validity of real-time data is maintained by periodic update transactions. In this paper, we examine the problem of period and deadline assignment for these upda...
Ming Xiong, Krithi Ramamritham
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
14 years 11 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner