Imagen de Portada

Scheduling Jobs with Work-Inefficient Parallel Solutions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kuszmaul, William, Westover, Alek
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Nearly Quadratic Improvement for Memory Reallocation
por: Farach-Colton, Martin, et al.
Publicado: (2024)

When to Give Up on a Parallel Implementation
por: Sheffield, Nathan S., et al.
Publicado: (2024)

On the Relationship Between Several Variants of the Linear Hashing Conjecture
por: Westover, Alek
Publicado: (2023)

Listing 6-Cycles in Sparse Graphs
por: Williams, Virginia Vassilevska, et al.
Publicado: (2024)

A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations
por: Kuszmaul, William
Publicado: (2025)

The Multiplicative Version of Azuma's Inequality, with an Application to Contention Analysis
por: Kuszmaul, William, et al.
Publicado: (2021)

Tight Analyses of Ordered and Unordered Linear Probing
por: Braverman, Mark, et al.
Publicado: (2025)

Efficient $d$-ary Cuckoo Hashing at High Load Factors by Bubbling Up
por: Kuszmaul, William, et al.
Publicado: (2025)

Fingerprint Filters Are Optimal
por: Kuszmaul, William, et al.
Publicado: (2025)

Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck
por: Kuszmaul, William, et al.
Publicado: (2025)

Tight Bounds for Classical Open Addressing
por: Bender, Michael A., et al.
Publicado: (2024)

Optimal Non-Oblivious Open Addressing
por: Bender, Michael A., et al.
Publicado: (2025)

History-Independent Load Balancing
por: Bender, Michael A., et al.
Publicado: (2026)

Optimal Bounds for Open Addressing Without Reordering
por: Farach-Colton, Martin, et al.
Publicado: (2025)

Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval
por: Kuszmaul, William, et al.
Publicado: (2024)

Job Scheduling under Base and Additional Fees, with Applications to Mixed-Criticality Scheduling
por: Hsieh, Yi-Ting, et al.
Publicado: (2025)

Engineering Optimal Parallel Task Scheduling
por: Akram, Matthew, et al.
Publicado: (2024)

The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts
por: Haas, Niklas, et al.
Publicado: (2025)

Layered List Labeling
por: Bender, Michael A., et al.
Publicado: (2024)

Static Retrieval Revisited: To Optimality and Beyond
por: Hu, Yang, et al.
Publicado: (2025)

Global Predecessor Indexing: Avoiding Binary Search in Weighted Job Scheduling
por: Joshi, Amit
Publicado: (2025)

Preprocessed 3SUM for Unknown Universes with Subquadratic Space
por: Kirkpatrick, Yael, et al.
Publicado: (2026)

Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines
por: Heeger, Klaus, et al.
Publicado: (2024)

A Practical 73/50 Approximation for Contiguous Monotone Moldable Job Scheduling
por: Jansen, Klaus, et al.
Publicado: (2026)

High Probability Work Efficient Parallel Algorithms
por: Hutton, Chase, et al.
Publicado: (2026)

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks
por: Chen, Chi-Yeh
Publicado: (2025)

Scheduling Multi-Server Jobs is Not Easy
por: Vaze, Rahul
Publicado: (2024)

Tighter Bounds on Non-clairvoyant Parallel Machine Scheduling with Prediction to Minimize Makespan
por: Chen, Tianqi, et al.
Publicado: (2025)

Nearly Optimal List Labeling
por: Bender, Michael A., et al.
Publicado: (2024)

Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP
por: Karczmarz, Adam, et al.
Publicado: (2025)

Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth
por: Agarwal, Arpit, et al.
Publicado: (2024)

Parallel Small Vertex Connectivity in Near-Linear Work and Polylogarithmic Depth
por: Jiang, Yonggang, et al.
Publicado: (2025)

Parallel $(1+ε)$-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work
por: Haeupler, Bernhard, et al.
Publicado: (2025)

Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances
por: Brand, Jan van den, et al.
Publicado: (2025)

Approximation algorithms for Job Scheduling with reconfigurable resources
por: Bergé, Pierre, et al.
Publicado: (2023)

Root-to-Leaf Scheduling in Write-Optimized Trees
por: Chung, Christopher, et al.
Publicado: (2024)

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
por: Kaul, Matthias, et al.
Publicado: (2024)

A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Paths
por: Fischer, Nick, et al.
Publicado: (2024)

Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
por: Ashvinkumar, Vikrant, et al.
Publicado: (2026)

Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
por: Mendoza-Cadena, Mirabel, et al.
Publicado: (2026)