scientific article; zbMATH DE number 436076

MaRDI QIDQ3139861zbMATH OpenFDO

Authors Ravi Varadarajan, Pedro I. Rivera-Vega

Publication date 11 November 1993

zbMATH Keywords

approximate solutionfile redistribution schedulingNP-hardpolynomial time algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling File Transfers
• Scheduling File Transfers for Trees and Odd Cycles
• The topology aware file distribution problem
• The topology aware file distribution problem
• SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS

Cited in

(3)

• A heuristic algorithm for the reliability-oriented file assignment in a distributed computing system
• The topology aware file distribution problem
• File and workload allocation on a local multi-access computer network: incorporating local processing and communication overhead

This page was built for publication:

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