11561 search results - page 1757 / 2313 » Open Distributed Processing |
182
Voted
JPDC
2006
2006
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
15 years 6 months ago
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...
202
click to vote
ERCIM
2007
15 years 6 months ago
2007
With the advent of Grid and application technologies, scientists and engineers are building more and more complex applications to manage and process large data sets, and execute s...
187
click to vote
PERCOM
2008
ACM
15 years 6 months ago
2008
ACM
In this paper, we propose a peer-to-peer approach to derive and obtain additional context data from lowlevel context data that may be spread over multiple domains in pervasive com...
189
click to vote
IDA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present a method to extract a time series (Number of Active Requests (NAR)) from web cache logs which serves as a transport level measurement of internet traffic. This...
181
Voted
QUESTA
2006
15 years 6 months ago
2006
In this paper we study a single-server queue where the inter-arrival times and the service times depend on a common discrete time Markov Chain. This model generalizes the well-kno...