On a local protocol for concurrent file transfers

DOI10.1007/S00224-013-9500-1MaRDI QIDQ487273zbMATH OpenOpenAlexFDO

Authors Mohammad T. Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat

Publication date 19 January 2015

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.2937

zbMATH Keywords

schedulingaverage completion timefile transferlocal protocolMakeSpan

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Distributed systems (68M14) Network protocols (68M12)

Recommendations

• File and workload allocation on a local multi-access computer network: incorporating local processing and communication overhead
• Improving Networked File System Performance Using a Locality-Aware Cooperative Cache Protocol
• SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS
• Optimizing remote file access for parallel and distributed network applications
• Protocols with constant local storage and unreliable communication
• The Complexity of File Transfer Scheduling with Forwarding
• Optimal file allocation in a loop topology local area network
• On locality and the exchange law for concurrent processes

Cites work

• scientific article; zbMATH DE number 1187164 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1848399 (Why is no real title available?)
• scientific article; zbMATH DE number 2102785 (Why is no real title available?)
• A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
• A better than “best possible” algorithm to edge color multigraphs
• An asymptotic approximation scheme for multigraph edge coloring
• Approximation algorithms for shop scheduling problems with minsum objective
• Approximation and Online Algorithms
• Bounds for Certain Multiprocessing Anomalies
• Combinatorial algorithms for data migration to minimize average completion time
• Data migration to minimize the total completion time
• Graph theory
• Improved bounds for scheduling conflicting jobs with minsum criteria
• Improved results for data migration and open shop scheduling
• Min Sum Edge Coloring in Multigraphs Via Configuration LP
• Minimum sum multicoloring on the edges of trees
• On algorithms for efficient data migration
• On chromatic sums and distributed resource allocation
• Scheduling File Transfers
• Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees

Cited in

(1)

• Improved bounds for randomized preemptive online matching

Describes a project that uses

Uses Software

• MapReduce

This page was built for publication: On a local protocol for concurrent file transfers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q487273)