scispace - formally typeset
Journal ArticleDOI

Comparative Models of the File Assignment Problem

Lawrence W. Dowdy, +1 more
- 01 Jun 1982 - 
- Vol. 14, Iss: 2, pp 287-313
TLDR
This perspective exposes the further research which is necessary in order to provide a truly satisfactory solution to the file assignment problem.
Abstract
The optimal distribution of files among storage nodes is a major problem m computer system optimization. Differing design goals, varying system assumptions, and contrasting solution techniques yield a disparity of optimal file assignments. This paper views the differing file assignment models in a uniform manner Relative advantages and weaknesses of the various models become immediately apparent. This perspective exposes the further research which is necessary m order to provide a truly satisfactory solution to the file assignment problem

read more

Citations
More filters
Book

Principles of Distributed Database Systems

TL;DR: This third edition of a classic textbook can be used to teach at the senior undergraduate and graduate levels and concentrates on fundamental theories as well as techniques and algorithms in distributed data management.
Journal ArticleDOI

Fundamental Limits of Caching

TL;DR: This paper proposes a novel coded caching scheme that exploits both local and global caching gains, leading to a multiplicative improvement in the peak rate compared with previously known schemes, and argues that the performance of the proposed scheme is within a constant factor of the information-theoretic optimum for all values of the problem parameters.
Journal ArticleDOI

Decentralized coded caching attains order-optimal memory-rate tradeoff

TL;DR: In this paper, the authors propose an efficient caching scheme, in which the content placement is performed in a decentralized manner, and despite this lack of coordination, the proposed scheme is nevertheless able to create coded-multicasting opportunities and achieves a rate close to the optimal centralized scheme.
Proceedings ArticleDOI

Distributed Caching Algorithms for Content Distribution Networks

TL;DR: This paper develops light-weight cooperative cache management algorithms aimed at maximizing the traffic volume served from cache and minimizing the bandwidth cost, and establishes that the performance of the proposed algorithms is guaranteed to be within a constant factor from the globally optimal performance.
Journal ArticleDOI

Fundamental Limits of Caching in Wireless D2D Networks

TL;DR: A caching strategy based on deterministic assignment of subpackets of the library files, and a coded delivery strategy where the users send linearly coded messages to each other in order to collectively satisfy their demands are proposed.
References
More filters
Journal ArticleDOI

Task Allocation in Distributed Data Processing

TL;DR: This research suggests that a programming approach is the task allocation strategy most likely to balance these conflicting factors.
Journal ArticleDOI

Optimal allocation of resources in distributed information networks

TL;DR: Numerical results for a variety of network configurations indicate that the heuristic algorithm, while not theoretically convergent, yields practicable low cost solutions with substantial savings in computer processing time and storage requirements.
Proceedings ArticleDOI

Allocation of copies of a file in an information network

TL;DR: This work considers a mathematical model of an information network of n nodes, some of which contain copies of a given data file, and is concerned with transactions with the multiply-located file.
Journal ArticleDOI

Optimal program and data locations in computer networks

TL;DR: An optimization procedure for the allocation of program and data files in a computer network is presented, which takes into account the dependencies between files and programs such as occur in real heterogeneous computer networks.