Work

Multiprocessor Scheduling with Memory Constraints: Fundamental Properties and Finding Optimal Solutions

Year: 2025

Type: conference-paper

Abstract: We study the problem of scheduling a general computational DAG on multiple processors in a 2-level memory hierarchy. This setting is a natural generalization of several prominent models in the literature, and it simultaneously captures workload balancing, communication, and data movement due to cache size limitations. We first analyze the fundamental properties of this problem from a theoretical perspective, such as its computational complexity. We also prove that optimizing parallelization and memory management separately, as done in many applications, can result in a solution that is a linear factor away from the optimum.

Source: Proceedings of the International Conference on Parallel Processing

DOI: 10.1145/3754598.3754676

Authors: Pál András Papp, Toni Böhnlein, Albert-Jan N. Yzelman

Language: English

Topic: Parallel Computing and Optimization Techniques

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4414880253

FWCI:

Cites:

Cited by:

Related to: