A comparison of receiver-initiated and sender-initiated adaptive load sharing
Performance Evaluation
A study of dynamic load balancing in a distributed system
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
Efficient computation of optimal assignments for distributed tasks
Journal of Parallel and Distributed Computing
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
A study of file sizes and functional lifetimes
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
Modeling distributed file systems
ACM SIGMETRICS Performance Evaluation Review
Design of optimal distributed file systems: a framework for research
ACM SIGOPS Operating Systems Review
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Migration of processes, files, and virtual devices in the MDX operating system
ACM SIGOPS Operating Systems Review
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
ACM Computing Surveys (CSUR)
Adaptive Routing for Dynamic Applications in Massively Parallel Architectures
IEEE Parallel & Distributed Technology: Systems & Technology
File Migration and File Replication: A Symbiotic Relationship
IEEE Transactions on Parallel and Distributed Systems
A heuristic approach to resource locations in broadband networks
Journal of Network and Computer Applications
A File Migration Scheme for Reducing File Access Latency in Mobile Computing Environments
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part II
An experimental study of load balancing on Amoeba
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Journal of Parallel and Distributed Computing
A demand based fault tolerant file replication model for clouds
Proceedings of the CUBE International Information Technology Conference
| Hi-index | 0.00 |
The author presents a distributed algorithm that considers the number of read and write accesses to files for every process type, the number of processes and their demands on system resources, the utilization of bottlenecks on all machines, and file sizes. Performance improvement obtained with the algorithm is discussed and proved. A number of experiments executed in a distributed system in order to predict the impact on performance of various algorithm strategies are examined. The experiments show changes in system performance due to file and process placement, file replication, and file and process migration.