Introduction to algorithms
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing - Special issue on parallel evolutionary computing
A Priority-Driven Flow Control Mechanism for Real-Time Traffic in Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Dynamic mapping of a class of independent tasks onto heterogeneous computing systems
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
WWW Traffic Reduction and Load Balancing through Server-Based Caching
IEEE Parallel & Distributed Technology: Systems & Technology
Enhancing the Web's Infrastructure: From Caching to Replication
IEEE Internet Computing
EDD Algorithm Performance Guarantee for Periodic Hard-Real-Time Scheduling in Distributed Systems
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
An Overview of MSHN: The Management System for Heterogeneous Networks
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
An Efficient Scheme for Dynamic Data Replication
An Efficient Scheme for Dynamic Data Replication
Bandwidth Tracking in Distributed Heterogeneous Networking Environments
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Collective Value of QoS: A Performance Measure Framework for Distributed Heterogeneous Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
A path selection-based algorithm for real-time data staging in Grid applications
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
Cost-effective multicast approaches for time-critical applications in dynamic network environments
Journal of High Speed Networks
Performance of file replication policies for real-time file access in data grids
Proceedings of the first international conference on Networks for grid applications
Journal of Parallel and Distributed Computing
Future Generation Computer Systems
Enhancing security of real-time applications on grids through dynamic scheduling
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
International Journal of Network Management
Hi-index | 0.00 |
Providing up-to-date input to users' applications is an important data management problem for a distributed computing environment, where each data storage location and intermediate node may have specific data available, storage limitations, and communication links available. Sites in the network request data items and each request has an associated deadline and priority. In a military situation, the data staging problem involves positioning data for facilitating a faster access time when it is needed by programs that will aid in decision making. This work concentrates on solving a basic version of the data staging problem in which all parameter values for the communication system and the data request information represent the best known information collected so far and stay fixed throughout the scheduling process. The network is assumed to be oversubscribed and not all requests for data items can be satisfied. A mathematical model for the basic data staging problem is introduced. Then, three multiple-source shortest-path algorithm-based heuristics for finding a near-optimal schedule of the communication steps for staging the data are presented. Each heuristic can be used with each of four cost criteria developed. Thus, 12 implementations are examined. In addition, two different weightings for the relative importance of different priority levels are considered. The performance of the proposed heuristics are evaluated and compared by simulations. The proposed heuristics are shown to perform well with respect to upper and lower bounds. Furthermore, the heuristics and a complex cost criterion allow more highest priority messages to be received than a simple-cost-based heuristic that schedules all highest priority messages first.