885 search results - page 83 / 177 » An investigation of the performance of various dynamic sched... |
ICALP
2001
Springer
14 years 6 days ago
2001
Springer
Abstract. In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced parti...
PIMRC
2008
IEEE
14 years 2 months ago
2008
IEEE
—Proportional fair scheduling (PFS) provides good balance between throughput and fairness via multi-user diversity and game-theoretic equilibrium. Very little analytical work exi...
KBSE
2007
IEEE
14 years 2 months ago
2007
IEEE
Programs written in languages that provide direct access to memory through pointers often contain memory-related faults, which may cause non-deterministic failures and even securi...
WECWIS
2002
IEEE
14 years 19 days ago
2002
IEEE
Various dynamic content caching approaches have been proposed to address the performance and scalability problems faced by many Web sites that utilize dynamic content generation a...
WORDS
2003
IEEE
14 years 1 months ago
2003
IEEE
This paper summarizes some of our unclassified work on concepts and techniques for performing automated runtime time-critical resource management (especially scheduling) in large ...