L.W. Dowdy and D.V. Foster. Comparative Models of the File Assignment Problem. ACM Computing Surveys, 14(2):287-313, June 1982. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Budget Constrained Minimum Cost Connected Medians - Konjevod, Krumke, Marathe (Correct)
....are connected to the backbone via direct links. The major requirement is that the total access cost for the users is within a specified bound, whereas the construction cost of the backbone network should be minimized. Similar problems arise in the efficient maintenance of distributed databases [28, 6, 5, 20, 9]. Other applications of BCCMED include location theory and manufacturing logistics (see [25, 27] and the references cited therein) In this paper, we study the complexity and approximability of BCCMED. The paper is organized as follows. In Section 2 we formally define the problem under study and ....
L. W. Dowdy and D. V. Foster. Comparative models of the file assignment problem. ACM Computing Surveys, 14(2):287--313, June 1982.
Models for Internet Cache Location - Adam Wierzbicki Institute (2002) (1 citation) (Correct)
.... network called a Content Delivery Network (CDN) The problem of information location to maximize performance or minimize the cost of a system that uses this information has been studied extensively since the early 1980s in several fields, including distributed databases, storage systems and CDNs [6, 1, 7]. This previous work solved the following decision problem: given a set of objects (files, pages of memory) and a set of potential locations, decide in which locations to place copies of the objects in order to optimize some objective and satisfy some additional constraints. A practical example of ....
L. Dowdy and D. Foster. Comparative models of the file assignment problem. Computing Surveys, 14, 1982.
Researching System Administration - Anderson (Correct)
....in a data center. It uses simple metrics for performance such as number of active connections and overall response time; it is similar in nature to the automatic loop in section 5.2.3 in its management of compute and network resources. Existing solutions to the file assignment problem [DF82, Wol89] use heuristic optimization models to assign files to disks to get improvements in I O response times. The work described on file allocation in [GWS91, SWZ98] will automatically determine an optimal stripe width for files, and stripe those files over a set of homogeneous disks. They then ....
Lawrence W. Dowdy and Derrel V. Foster. Comparative models of the file assignment problem. ACM Computing Surveys, 14(2):287--313, June 1982.
Realization of the Highly Integrated Distributed Real-Time.. - Lind (1999) (Correct)
....and the CPU cost for processing the information such as updating, retrieving, and storing. Network cost are decomposed into communication and transmission costs. This problem of determining a solution to this problem under varying system conditions has been addressed in a number of publications [ChL87, DoF82, MoL77, Mur83, NoA87, Pol94, Pu86, RoS96, SeS79, Seg76, Yu85 and ZSA92]. Solutions to the file assignment problem can be divided into two classes: static file assignment and dynamic file assignment. In static file assignment [MoL77, Mur83, and Pu86] the design of the file assigner is based upon a set of time invariant system parameters. Therefore, in solutions ....
Dowdy L.W., Foster D.V. (1982); "Comparative Models of the File Assignment Problem"; ACM Computing Surveys Vol. 14 No. 2 (1982)
Document Replication and Distribution in Extensible.. - Zhuo, Wang, Lau (2002) (Correct)
....placement of replicas across multiple servers in order to increase the overall system performance. Previous work on data replication problems mainly focused on networked systems, distributed database systems, and most recently, content delivery networks (CDNs) The File Allocation Problem (FAP) [13] studies how to assign files to different nodes in a distributed environment in order to optimize certain performance metric (e.g. total network traffic) The files can have multiple copies and they are allocated to different nodes with respect to the available storage capacity of these nodes. ....
....given metric. FAP has been proved to be NP complete. Many previous research projects assumed that access patterns are known and remain unchanged. Some solutions for dynamic environments were proposed in [21, 4, 39] A complete survey on models for FAP in computer network systems can be found in [13]. The document distribution problem of GDWS systems can be seen as an instance of the FAP, in which each document can have multiple copies and storage space limitation is considered. However, the solutions for the FAP cannot be used directly in a GDWS system for the following reason. Firstly, ....
L.W. Dowdy and D.V. Foster. Comparative Models of the File Assignment Problem. ACM Computing Surveys, 14(2):287-313, June 1982.
Do We Need Replica Placement Algorithms in Content Delivery .. - Karlsson, Mahalingam (2002) (6 citations) (Correct)
....distributed algorithm that evaluates its placement after each single access, while an RPA is evaluated with the frequency of hours or days and can thus be much more elaborate and even centralized. The replica placement problem is an instance of the classical file allocation problem (FAP) [5], in which only algorithms that allow replicas to be created are considered. There have been a plethora of proposed RPAs [6, 7, 8, 9, 11, 12, 13, 16, 17, 20] see [10] for an extensive analysis) for possible use in CDNs, but no direct comparison between them or with caching has been performed. The ....
L. W. Dowdy and D. V. Foster. Comparative Models of the File Assignment Problem. ACM Computer Surveys, 14(2):287--313, 1982.
Optimal Placement of Replicas in Trees with Write, and.. - Kalpakis, Dasgupta.. (Correct)
....storage costs. We are interested in finding a residence set of minimum cost. We call this problem the optimal residence set problem for trees with read, write, and storage costs. The optimal residence set (file allocation) problem has been studied extensively in the literature. Dowdy and Fos ter [2] survey a number of mixed linear programming models for the file allocation problem. Wolfson and Milo [1] consider the optimal residence set problem without stor age costs for various interconnection networks (completelyconnected, tree, and ring networks) They show that the optimal residence set ....
L.W. Dowdy and D. V. Foster, "Comparative models of the file assignment problem," ACM Computing Surveys, vol. 14, no. 2, pp. 287-313, 1982.
A Unified Framework for Evaluating Replica Placement.. - Karlsson, Karamanolis, .. (2002) (1 citation) (Correct)
....proposed in the CDN literature, but until now, there has been no systematic way to classify and compare these algorithms. The replica placement problem has also been studied extensively in several other distributed computing fields, including the file assignment problem (FAP) in storage systems [13], distributed databases [26] network location [11] and data management [29] So, a question that arises is how all these approaches are related to each other and how can one systematically represent and evaluate new as well as existing algorithms within and between these fields. In this paper, ....
....depending on the threshold) 5 Related Work Despite the importance of the replica placement problem and its practical implications, little has been done to compare the various approaches and their applicability to different system models. A survey of the file assignment problem by Dowdy et al.[13] was published in 1982. However, it focuses mostly on problem definitions and their classifications and comparison on a feature by feature basis. Levin and Morgan [26] introduced a framework for replica placement problems, in the context of distributed databases. They categorize algorithms ....
L. W. Dowdy and D. V. Foster. Comparative Models of the File Assignment Problem. ACM Computer Surveys, 14(2):287--313, 1982.
Ergastulum: Quickly Finding Near-Optimal Storage.. - Anderson.. (4 citations) (Correct)
....[28] bin packing heuristic. Minerva [2] extends Forum to handle disk arrays. The comparison with Minerva, and hence a superset of Forum can be found in Section 4.1 where we show that Ergastulum is faster and generates as good or better designs. Existing solutions to the file assignment problem [11, 35] use heuristic optimization models to assign files to disks to get improvements in I O response times. The file allocation schemes described 23 in [12, 24] automatically determine an optimal stripe width for files, and stripe those files over a set of homogeneous disks. They then balance the load ....
L. W. Dowdy and D. V. Foster. Comparative models of the file assignment problem. ACM Computing Surveys, 14(2):287--313, June 1982.
Steiner-Optimal Data Replication in Tree Networks - Kalpakis, Dasgupta, Wolfson (2001) (Correct)
....write policy used in [10] the Minimum Spanning Tree write policy (or MST write policy) and the optimal replica set computed in [10] the MST optimal replica set for a tree network. The optimal residence set (file allocation) problem has been studied extensively in the literature. Dowdy and Foster [5] survey a number of mixed linear programming models for the file allocation problem. Wolfson and Milo [15] consider the optimal residence set problem without storage costs for various interconnection networks (completely connected, tree, and ring networks) They show that the optimal residence set ....
L. W. Dowdy and D. V. Foster. Comparative models of the file assignment problem. A CM Computing Surveys, 14(2):287-313, 1982.
Department of Computer ScienceandInformation Systems - The University Of (2 citations) (Correct)
No context found.
L.W. Dowdy and D.V. Foster. Comparative Models of the File Assignment Problem. ACM Computing Surveys, 14(2):287-313, June 1982.
A Quantitative Approach - Hakim Weatherspoon Byung-Gon (Correct)
No context found.
L. W. Dowdy and Derrell V. Foster. Comparative models of the file assignment problem. ACM Computing Surveys, 14(2):287-- 313, 1982.
Modeling Replica Availability in Large Data Grids - Schintke, Reinefeld (2003) (Correct)
No context found.
L.W. Dowdy and D.V. Foster, "Comparative Models of the File Assignment Problem", ACM Computing Surveys, 14(2):287--313, 1982.
Bounds on the Replication Cost for QoS - Karlsson, Karamanolis (2003) (Correct)
No context found.
L. Dowdy and D. Foster. Comparative Models of the File Assignment Problem. ACM Computer Surveys, 14(2):287-- 313, 1982.
Optimal Video Replication and Placement on a Cluster of - Video-On-Demand Servers.. (Correct)
No context found.
L.W. Dowdy and D.V. Foster. Comparative models of the file assignment problem. ACM Computing Surveys, 14(2):287-- 313, 1982.
Resource Assignment for Large-Scale Computing.. - Zhu, Santos, Ward.. (2003) (Correct)
No context found.
L.W. Dowdy and D.V. Foster, "Comparative models of the file assignment problem," ACM Computer Sueveys, vol. 14(2), pp. 287-313, 1982.
Placement Problems for Transparent Data Replication Proxy Services - Xu, Li, Lee (2002) (1 citation) (Correct)
No context found.
L. Dowdy and D. Foster, "Comparative models of the file assignment problem," ACM Comput. Surv., vol. 14, no. 2, pp. 287--313, June 1982.
On Replica Placement For Qos-Aware Content Distribution - Tang, Xu (2004) (1 citation) (Correct)
No context found.
L. W. Dowdy and D. V. Foster, "Comparative models of the file assignment problem," ACM Computing Surveys, vol. 14, no. 2, pp. 287-- 313, June 1982.
Choosing Replica Placement Heuristics for Wide-Area Systems - Karlsson, Karamanolis (Correct)
No context found.
L. Dowdy and D. Foster. Comparative Models of the File Assignment Problem. ACM Computer Surveys, 14(2):287--313, 1982.
Modeling Replica Availability in Large Data Grids - Schintke, Reinefeld (2003) (Correct)
No context found.
L.W. Dowdy and D.V. Foster, "Comparative Models of the File Assignment Problem", ACM Computing Surveys, 14(2):287--313, 1982.
A Framework for Evaluating Replica Placement Algorithms - Karlsson, Karamanolis.. (2002) (4 citations) (Correct)
No context found.
L. W. Dowdy and D. V. Foster, "Comparative Models of the File Assignment Problem," ACM Computer Surveys, vol. 14, no. 2, pp. 287--313, 1982.
Unknown - Madhukar Korupolu Placement (Correct)
No context found.
D. Dowdy and D. Foster. Comparative models of the file assignment problem. ACM Computing Surveys, 14:287--313, 1982.
Choosing Replica Placement Heuristics for Wide-Area Systems - Karlsson, Karamanolis (Correct)
No context found.
L. Dowdy and D. Foster. Comparative Models of the File Assignment Problem. ACM Computer Surveys, 14(2):287--313, 1982.
Choosing Replica Placement Heuristics for Wide-Area Systems - Karlsson, Karamanolis (Correct)
No context found.
L. Dowdy and D. Foster. Comparative Models of the File Assignment Problem. ACM Computer Surveys, 14(2):287--313, 1982.
File Assignment in Parallel I/O Systems with Minimal.. - Lee, Scheuermann.. (Correct)
No context found.
W. Dowdy and D. Foster. Comparative models of the file assignment problem. ACM Computing Surveys, 14(2), 1982.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC