%0 Journal Article %1 Soomro2022-ok %A Soomro, Pirah Noor %A Abduljabbar, Mustafa %A Castrillon, Jeronimo %A Pericàs, Miquel %D 2022 %I arXiv %K %T Shisha: Online scheduling of CNN pipelines on heterogeneous architectures %X Chiplets have become a common methodology in modern chip design. Chiplets improve yield and enable heterogeneity at the level of cores, memory subsystem and the interconnect. Convolutional Neural Networks (CNNs) have high computational, bandwidth and memory capacity requirements owing to the increasingly large amount of weights. Thus to exploit chiplet-based architectures, CNNs must be optimized in terms of scheduling and workload distribution among computing resources. We propose Shisha, an online approach to generate and schedule parallel CNN pipelines on chiplet architectures. Shisha targets heterogeneity in compute performance and memory bandwidth and tunes the pipeline schedule through a fast online exploration technique. We compare Shisha with Simulated Annealing, Hill Climbing and Pipe-Search. On average, the convergence time is improved by ~35x in Shisha compared to other exploration algorithms. Despite the quick exploration, Shisha's solution is often better than that of other heuristic exploration algorithms.

@article{Soomro2022-ok, abstract = {Chiplets have become a common methodology in modern chip design. Chiplets improve yield and enable heterogeneity at the level of cores, memory subsystem and the interconnect. Convolutional Neural Networks (CNNs) have high computational, bandwidth and memory capacity requirements owing to the increasingly large amount of weights. Thus to exploit chiplet-based architectures, CNNs must be optimized in terms of scheduling and workload distribution among computing resources. We propose Shisha, an online approach to generate and schedule parallel CNN pipelines on chiplet architectures. Shisha targets heterogeneity in compute performance and memory bandwidth and tunes the pipeline schedule through a fast online exploration technique. We compare Shisha with Simulated Annealing, Hill Climbing and Pipe-Search. On average, the convergence time is improved by ~35x in Shisha compared to other exploration algorithms. Despite the quick exploration, Shisha's solution is often better than that of other heuristic exploration algorithms.}, added-at = {2024-09-10T11:56:37.000+0200}, author = {Soomro, Pirah Noor and Abduljabbar, Mustafa and Castrillon, Jeronimo and Peric{\`a}s, Miquel}, biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/24bd3387724e504942327cb2905f36638/scadsfct}, interhash = {5a37f29043f07b113d4a1b5dbfe0a861}, intrahash = {4bd3387724e504942327cb2905f36638}, keywords = {}, publisher = {arXiv}, timestamp = {2024-09-10T15:15:57.000+0200}, title = {Shisha: Online scheduling of {CNN} pipelines on heterogeneous architectures}, year = 2022 }