We lifted 9 functions out of this paper's own repositories and ran 6 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| zigzag-project/defines | canonical | 2 of 2 |
| kuleuven-micas/acco | pwc_unofficial | 2 of 4 |
| ZigZag-Project/zigzag | pwc_unofficial | 2 of 3 |
| Function | Status | Where it lives |
|---|---|---|
| annotate_heatmap | Ran | zigzag-project/defines/plot_helper_funcs.py code served (permissive licence) · get_code("270a7a067a1c0319") |
| extract_port_latency | Ran | kuleuven-micas/acco/classes/depthfirst/data_copy_layer.py code served (permissive licence) · get_code("528110165dfbbbed") |
| hash_sha512 | Ran | ZigZag-Project/zigzag/zigzag/utils.py code served (permissive licence) · get_code("fe45575f66dbe74b") |
| heatmap | Ran | zigzag-project/defines/plot_helper_funcs.py code served (permissive licence) · get_code("cfe5673960d811ad") |
| pickle_deepcopy | Ran | ZigZag-Project/zigzag/zigzag/utils.py code served (permissive licence) · get_code("979d8736de4592ce") |
| pickle_deepcopy | Ran | kuleuven-micas/acco/utils.py code served (permissive licence) · get_code("c54085ffaf8bf13f") |
| calc_MUW_union | Not yet run | kuleuven-micas/acco/classes/cost_model/cost_model.py code served (permissive licence) · get_code("9247aaa762351759") |
| get_shared_mem_list | Not yet run | kuleuven-micas/acco/classes/cost_model/cost_model.py code served (permissive licence) · get_code("f133edb257d3344c") |
| pickle_save | Not yet run | ZigZag-Project/zigzag/zigzag/utils.py code served (permissive licence) · get_code("10a1b5d040c1c4cb") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
DNN workloads can be scheduled onto DNN accelerators in many different ways: from layer-by-layer scheduling to cross-layer depth-first scheduling (a.k.a. layer fusion, or cascaded execution). This results in a very broad scheduling space, with each schedule leading to varying hardware (HW) costs in terms of energy and latency. To rapidly explore this vast space for a wide variety of hardware architectures, analytical cost models are crucial to estimate scheduling effects on the HW level. However, state-of-the-art cost models are lacking support for exploring the complete depth-first scheduling space, for instance focusing only on activations while ignoring weights, or modeling only DRAM accesses while overlooking on-chip data movements. These limitations prevent researchers from systematically and accurately understanding the depth-first scheduling space. After formalizing this design space, this work proposes a unified modeling framework, DeFiNES, for layer-by-layer and depth-first scheduling to fill in the gaps. DeFiNES enables analytically estimating the hardware cost for possible schedules in terms of both energy and latency, while considering data access at every memory level. This is done for each schedule and HW architecture under study by optimally choosing the active part of the memory hierarchy per unique combination of operand, layer, and feature map tile. The hardware costs are estimated, taking into account both data computation and data copy phases. The analytical cost model is validated against measured data from a taped-out depth-first DNN accelerator, DepFiN, showing good modeling accuracy at the end-to-end neural network level. A comparison with generalized state-of-the-art demonstrates up to 10X better solutions found with DeFiNES.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2212.05344")
get_code_for_paper("2212.05344")
have("2212.05344")
Connect an agent — have() is free.