@inproceedings{boehnlein24b,
      title={Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs}, 
      author={Toni B\"{o}hnlein and P\'{a}l Andr\'{a}s Papp and A. N. Yzelman},
      year={2025},
      editor="Ulrich Schmid and Roman Kuznets",
      booktitle="Structural Information and Communication Complexity",
      publisher="Springer Nature Switzerland",
      address="Cham, Switzerland",
      pages="109--126",
      abstract="The well-studied red-blue pebble game models the execution of an arbitrary computational DAG by a single processor over a two-level memory hierarchy. We present a natural generalization to a multiprocessor setting where each processor has its own limited fast memory, and all processors share unlimited slow memory. To our knowledge, this is the first thorough study that combines pebbling and DAG scheduling problems, capturing the computation of general workloads on multiple processors with memory constraints and communication costs. Our pebbling model enables us to analyze trade-offs between workload balancing, communication and memory limitations, and it captures real-world factors such as superlinear speedups due to parallelization.",
      primaryClass={cs.DC},
      isbn="978-3-031-91736-3",
      doi="10.1007/978-3-031-91736-3_7",
      url={https://doi.org/10.1007/978-3-031-91736-3_7}
}