We propose an efficient placement algorithm and per-disk prefetching method to effectively support interactive operations in the media server. Our placement policy is incorporate...
: The ability to estimate the communication latency between arbitrary hosts on the Internet would enable the distributed computing applications to find the closest server or to fin...
R. Vijayprasanth, R. Kavithaa, Rajkumar Kettimuthu
Data Structure Abstractions for Asynchronous Web Applications Daniel S. Myers MIT CSAIL Jennifer N. Carlisle MIT CSAIL James A. Cowling MIT CSAIL Barbara H. Liskov MIT CSAIL The c...
Daniel S. Myers, Jennifer N. Carlisle, James A. Co...
Commercial server applications remain memory bound on modern multiprocessor systems because of their large data footprints, frequent sharing, complex non-strided access patterns, ...
Thomas F. Wenisch, Michael Ferdman, Anastasia Aila...
We consider two schemes for the distributionof Web documents. In the first scheme the sender repeatedly transmits the Web document into a multicast address, and receivers asynchr...