Scheduling File Transfers
From MaRDI portal
Publication:3741046
DOI10.1137/0214054zbMath0604.68039OpenAlexW1997370889MaRDI QIDQ3741046
Michael R. Garey, Andrea S. LaPaugh, Edward G. jun. Coffman, David S. Johnson
Publication date: 1985
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0214054
edge coloringNP-completenessapproximation algorithmscentral controllerprotocolsdistributed processing
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
An integer linear formulation for the file transfer scheduling problem, Edge-chromatic sum of trees and bounded cyclicity graphs, On a resource-constrained scheduling problem with application to distributed systems reconfiguration, Scheduling: agreement graph vs resource constraints, Scheduling with conflicts: Online and offline algorithms, Algorithms for data migration, Data transfers in networks, Coloration de graphes : fondements et applications, An approximation algorithm for scheduling on three dedicated machines, A note on M2-edge colorings of graphs, Bin packing with divisible item sizes, Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion, Distributed processing of divisible jobs with communication startup costs, Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers, Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors, A linear time algorithm for edge coloring of binomial trees, Minimum multiplicity edge coloring via orientation, Min Sum Edge Coloring in Multigraphs Via Configuration LP, The method of coloring in graphs and its application, \(\mathrm{M}_2\)-edge colorings of cacti and graph joins, On \(f\)-colorings of nearly bipartite graphs, Multi-coloring and job-scheduling with assignment and incompatibility costs, On a local protocol for concurrent file transfers, Scheduling multiprocessor tasks for mean flow time criterion, A branch-and-cut algorithm for a resource-constrained scheduling problem, Some graphs of class 1 for \(f\)-colorings, The complexity of path coloring and call scheduling, On the fg-coloring of graphs, Minimum sum multicoloring on the edges of trees, Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles, On the fractionalf-chromatic index of a graph, Minimum-delay schedules in layered networks, Combinatorial algorithms for data migration to minimize average completion time, Scheduling multiprocessor tasks -- An overview, Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors, On the complexity of coordinated display of multimedia objects, ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS, Scheduling multiprocessor tasks on two parallel processors
