Sciweavers

54 search results - page 3 / 11
» The Worst Page-Replacement Policy
Sort
View
CDC
2010
IEEE
105views Control Systems» more  CDC 2010»
13 years 4 months ago
Universal scheduling for networks with arbitrary traffic, channels, and mobility
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or n...
Michael J. Neely
CIKM
2006
Springer
14 years 1 months ago
Improving query I/O performance by permuting and refining block request sequences
The I/O performance of query processing can be improved using two complementary approaches. One can try to improve on the buffer and the file system management policies of the DB ...
Xiaoyu Wang, Mitch Cherniack
RTAS
2008
IEEE
14 years 4 months ago
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...
Harini Ramaprasad, Frank Mueller
CDC
2010
IEEE
112views Control Systems» more  CDC 2010»
13 years 4 months ago
Dynamic product assembly and inventory control for maximum profit
We consider a manufacturing plant that purchases raw materials for product assembly and then sells the final products to customers. There are M types of raw materials and K types o...
Michael J. Neely, Longbo Huang
CLEIEJ
2002
113views more  CLEIEJ 2002»
13 years 9 months ago
The MT Stack: Paging Algorithm and Performance in a Distributed Virtual Memory System
Advances in parallel computation are of central importance to Artificial Intelligence due to the significant amount of time and space their programs require. Functional languages ...
Marco T. Morazán, Douglas R. Troeger, Myles...