Non-clairvoyant scheduling with conflicts for unit-size jobs
type: Item
instance of: scholarly article
title: Non-clairvoyant scheduling with conflicts for unit-size jobs
zbMATH Open document ID: 1478.68028
author: Hongyang Sun
published in: Information Processing Letters
publication date: 2019-02-13T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 7021524
zbMATH Keywords: competitive analysis
zbMATH Keywords: online algorithms
zbMATH Keywords: conflict graphs
zbMATH Keywords: non-clairvoyant scheduling
zbMATH Keywords: makespan minimization
MaRDI profile type: Publication
full work available at URL: j.ipl.2018.12.008
OpenAlex ID: W2906349901
cites work: Transactional contention management as a Non-clairvoyant scheduling problem
cites work: On chromatic sums and distributed resource allocation
cites work: Sum Multicoloring of Graphs
cites work: Scheduling with conflicts: Online and offline algorithms
cites work: Zero knowledge and the chromatic number
cites work: Improved bounds for scheduling conflicting jobs with minsum criteria
cites work: Toward a theory of transactional contention managers
cites work: A still better performance guarantee for approximate graph coloring
cites work: Lower bounds for on-line graph coloring
cites work: Coloring inductive graphs on-line
cites work: Scheduling with conflicts on bipartite and interval graphs
cites work: Q3950561
cites work: An on-line graph coloring algorithm with sublinear performance ratio
cites work: Nonclairvoyant scheduling
cites work: Bounds on contention management algorithms
cites work: A competitive analysis for balanced transactional memory workloads
cites work: Window-based greedy contention management for transactional memory: theory and practice
Wikidata QID: Q128696268
DOI: 10.1016/J.IPL.2018.12.008
description: scientific article; zbMATH DE number 7021524