Sciweavers

124 search results - page 8 / 25
» Replacement Policies for Service-Based Systems
Sort
View
SYRCODIS
2008
95views Database» more  SYRCODIS 2008»
14 years 11 months ago
The Framework for Study Of Caching Algorithm Efficiency
In this paper we offer several models of reference sequences (traces of references) using Markov chains for testing of the replacement policies in caching systems. These models en...
Michael V. Grankov, Ngo Thanh Hung, Mosab Bassam Y...
WWW
2008
ACM
15 years 10 months ago
Non-intrusive monitoring and service adaptation for WS-BPEL
Web service processes currently lack monitoring and dynamic (runtime) adaptation mechanisms. In highly dynamic processes, services frequently need to be exchanged due to a variety...
Oliver Moser, Florian Rosenberg, Schahram Dustdar
ICS
2010
Tsinghua U.
14 years 12 months ago
The auction: optimizing banks usage in Non-Uniform Cache Architectures
The growing influence of wire delay in cache design has meant that access latencies to last-level cache banks are no longer constant. Non-Uniform Cache Architectures (NUCAs) have ...
Javier Lira, Carlos Molina, Antonio Gonzále...
IWMMDBMS
1998
123views more  IWMMDBMS 1998»
14 years 11 months ago
An Adaptive Block Management Scheme Using On-Line Detection of Block Reference Patterns
Recent research has shown that near optimal performance can be achieved by adaptive block replacement policies that use user-level hints regarding the block reference pattern. How...
Jongmoo Choi, Sam H. Noh, Sang Lyul Min, Yookun Ch...
103
Voted
INFOCOM
2006
IEEE
15 years 3 months ago
Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
Prasanna Chaporkar, Saswati Sarkar