Parallel execution of schedules with random dependency graph

DOI10.1016/j.tcs.2019.03.043zbMath1426.90150OpenAlexW2927293583MaRDI QIDQ2317877

Paweł Prałat, Tomasz Olczak, Bogumił Kamiński

Publication date: 13 August 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.03.043

zbMATH Keywords

binomial random graphsexecution of schedules

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Mixed integer programming (90C11) Stochastic scheduling theory in operations research (90B36)

Uses Software

• CPLEX
• MiniZinc
• JuMP
• DifferentialEquations.jl
• NeuralPDE.jl

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global EDF scheduling for parallel real-time tasks
• Handbook of computational economics. Vol. 2: Agent-based computational economics
• Random graph orders
• First order properties of random posets
• Linear extensions of a random partial order
• Project scheduling. A research handbook.
• Designing Scientific Applications on GPUs
• On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph
• Principles of Constraint Programming
• Chain Lengths in Certain Random Directed Graphs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Structure of Random Graph Orders
• Paths in graphs
• Reducibility among Combinatorial Problems
• Numerical Computations with GPUs
• Bounds for Certain Multiprocessing Anomalies
• JuMP: A Modeling Language for Mathematical Optimization
• Handbook on Scheduling
• Scheduling

This page was built for publication: Parallel execution of schedules with random dependency graph