Scheduling File Transfers
From MaRDI portal
Recommendations
- Scheduling bulk file transfers with start and end times
- Scheduling File Transfers for Trees and Odd Cycles
- SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS
- The Complexity of File Transfer Scheduling with Forwarding
- Euro-Par 2004 Parallel Processing
- Scheduling transmissions in a network
- An integer linear formulation for the file transfer scheduling problem
Cited in
(53)- Scheduling data transfers in a network and the set scheduling problem
- Data transfers in networks with transceivers
- Some graphs of class 1 for \(f\)-colorings
- Data transfers in networks
- Scheduling multiprocessor tasks on two parallel processors
- Bin packing with divisible item sizes
- Minimum sum multicoloring on the edges of trees
- On a resource-constrained scheduling problem with application to distributed systems reconfiguration
- Scheduling: agreement graph vs resource constraints
- An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem
- scientific article; zbMATH DE number 1929963 (Why is no real title available?)
- The complexity of path coloring and call scheduling
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
- A note on M2-edge colorings of graphs
- The Complexity of File Transfer Scheduling with Forwarding
- An integer linear formulation for the file transfer scheduling problem
- On the fractional \(f\)-chromatic index of a graph
- On the complexity of coordinated display of multimedia objects
- Scheduling File Transfers for Trees and Odd Cycles
- Euro-Par 2004 Parallel Processing
- Partitioning series-parallel multigraphs into v^*-excluding edge covers
- On \(f\)-colorings of nearly bipartite graphs
- Edge-chromatic sum of trees and bounded cyclicity graphs
- Min Sum Edge Coloring in Multigraphs Via Configuration LP
- Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories
- A linear time algorithm for edge coloring of binomial trees
- A branch-and-cut algorithm for a resource-constrained scheduling problem
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
- Scheduling bulk file transfers with start and end times
- Scheduling multiprocessor tasks -- An overview
- On minimizing dataset transfer time in an acyclic network with four servers
- An approximation algorithm for scheduling on three dedicated machines
- Minimum multiplicity edge coloring via orientation
- The method of coloring in graphs and its application
- Scheduling with conflicts: Online and offline algorithms
- On the fg-coloring of graphs
- ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS
- Distributed processing of divisible jobs with communication startup costs
- On a local protocol for concurrent file transfers
- Broadcasting a file in a communication network
- \(\mathrm{M}_2\)-edge colorings of cacti and graph joins
- SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS
- Minimum-delay schedules in layered networks
- Combinatorial algorithms for data migration to minimize average completion time
- Scheduling multiprocessor tasks for mean flow time criterion
- Scheduling data transfers in a network and the set scheduling problem
- Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles
- Algorithms for data migration
- scientific article; zbMATH DE number 436076 (Why is no real title available?)
- Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors
- Multi-coloring and job-scheduling with assignment and incompatibility costs
- The topology aware file distribution problem
- Coloration de graphes : fondements et applications
This page was built for publication: Scheduling File Transfers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3741046)
