Multiprocessor Scheduling with the Aid of Network Flow Algorithms
From MaRDI portal
Publication:4127388
DOI10.1109/TSE.1977.233840zbMath0355.68042MaRDI QIDQ4127388
Publication date: 1977
Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)
Related Items (48)
Extended cuts ⋮ Optimal task assignment with precedence in distributed computing systems ⋮ A methodology for multicriteria network partitioning ⋮ Experimental evaluation of a local search approximation algorithm for the multiway cut problem ⋮ On generalized greedy splitting algorithms for multiway partition problems ⋮ Index Matrices as a Cost Optimization Tool of Resource Provisioning in Uncertain Cloud Computing Environment ⋮ Task allocation model for distributed systems ⋮ Analysis of the effects of system parameters on load balancing ⋮ Algorithm for the discrete Weber's problem with an accuracy estimate ⋮ A Lagrangian relaxation algorithm for sparse quadratic assignment problems ⋮ AN EFFECTIVE APPROACH FOR DISTRIBUTED PROGRAM ALLOCATION ⋮ A PARALLEL SCHEDULING ALGORITHM FOR PARALLEL APPLICATIONS ⋮ A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms ⋮ The single allocation problem in the interacting three-hub network ⋮ Analysis of the module assignment problem in distributed computing systems with limited storage ⋮ A local search approximation algorithm for the multiway cut problem ⋮ Cooperative target allocation for air-sea heterogeneous unmanned vehicles against saturation attacks ⋮ The task allocation problem with constant communication. ⋮ Efficient allocation of chain-like task on chain-like network computers ⋮ Complexity analysis of new task allocation problem using network flow method on multicore clusters ⋮ Optimal networks for distributing nonsequential programs ⋮ Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts ⋮ A two-pass approach for optimally assigning linear tasks to multiprocessor systems ⋮ An exact algorithm for the minimum squared load assignment problem ⋮ Reliability-aware scheduling strategy for heterogeneous distributed computing systems ⋮ A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures ⋮ Heuristic task assignment for distributed computing systems ⋮ On minimum 3-cuts and approximating k-cuts using Cut Trees ⋮ A mathematical framework for delay analysis in single source networks ⋮ An improved partial solution to the task assignment and multiway cut problems ⋮ Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems ⋮ Using \(xQx\) to model and solve the uncapacitated task allocation problem ⋮ Task assignment in distributed computing systems ⋮ Unnamed Item ⋮ Cooperativead hoccomputing: towards enabling cooperative processing in wireless environments ⋮ A study of the quadratic semi-assignment polytope ⋮ Non-preemptive scheduling to maximize the minimum global inter-completion time ⋮ On module assignment in two-processor distributed systems ⋮ A linear program for the two-hub location problem ⋮ An algorithm for the multiprocessor assignment problem ⋮ An LC branch-and-bound algorithm for the module assignment problem ⋮ An improved approximation algorithm of MULTIWAY CUT. ⋮ On a bidirected relaxation for the MULTIWAY CUT problem ⋮ A hybrid genetic/optimization algorithm for a task allocation problem ⋮ Distributed task assignment using critical path estimate ⋮ Partitioning multiple-chain-like task across a host-satellite system ⋮ Optimal task allocation in hyercube multiprocessor ensembles ⋮ A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications
This page was built for publication: Multiprocessor Scheduling with the Aid of Network Flow Algorithms
