The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Dynamic Warp Formation and Scheduling for Efficient GPU Control Flow
Abstract
Recent advances in graphics processing units (GPUs) have resulted in massively parallel hardware that is easily programmable and widely available in commodity desktop computer systems. GPUs typically use single-instruction, multiple-data (SIMD) pipelines to achieve high performance with minimal overhead incurred by control hardware. Scalar threads are grouped together into SIMD batches, sometimes referred to as warps. While SIMD is ideally suited for simple programs, recent GPUs include control flow instructions in the GPU instruction set architecture and programs using these instructions may experience reduced performance due to the way branch execution is supported by hardware. One approach is to add a stack to allow different SIMD processing elements to execute distinct program paths after a branch instruction. The occurrence of diverging branch outcomes for different processing elements significantly degrades performance. In this paper, we explore mechanisms for more efficient SIMD branch execution on GPUs. We show that a realistic hardware implementation that dynamically regroups threads into new warps on the fly following the occurrence of diverging branch outcomes improves performance by an average of 20.7% for an estimated area increase of 4.7%.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Needleman, S. B., & Wunsch, C. D. (1970) · Journal of Molecular Biology · doi:10.1016/0022-2836(70)90057-4 · Cited by 11,288
Principles and Practices of Interconnection Networks
Dally, W. J., & Towles, B. (2004) · Cited by 3,260
The SimpleScalar tool set, version 2.0
Burger, D., & Austin, T. M. (1997) · ACM SIGARCH Computer Architecture News · doi:10.1145/268806.268810 · Cited by 3,048
Wattch: a framework for architectural-level power analysis and optimizations
Brooks, D., Tiwari, V., & Martonosi, M. (2000) · Proceedings of the 27th annual international symposium on Computer architecture - ISCA '00 · doi:10.1145/339647.339657 · Cited by 2,578
Advanced Compiler Design and Implementation
Muchnick, S. S. (1997) · Cited by 2,312
The SPLASH-2 programs: characterization and methodological considerations
Woo, S. C., Ohara, M., Torrie, E., Singh, J. P., & Gupta, A. (2002) · Proceedings 22nd Annual International Symposium on Computer Architecture · doi:10.1109/isca.1995.524546 · Cited by 1,601
Ho, R., Mai, K. W., & Horowitz, M. A. (2001) · Proceedings of the IEEE · doi:10.1109/5.920580 · Cited by 1,438
CACTI: an enhanced cache access and cycle time model
Wilton, S. J. E., & Jouppi, N. P. (1996) · IEEE Journal of Solid-State Circuits · doi:10.1109/4.509850 · Cited by 872
Texture and reflection in computer generated images
Blinn, J. F., & Newell, M. E. (1976) · Communications of the ACM · doi:10.1145/360349.360353 · Cited by 772
(1934) · Notes and Queries · doi:10.1093/nq/clxvii.nov17.360a · Cited by 725
Cited by
ISAAC: a convolutional neural network accelerator with in-situ analog arithmetic in crossbars
Shafiee, A., Nag, A., Muralimanohar, N., Balasubramonian, R., Strachan, J. P., Hu, M., Williams, R. S., & Srikumar, V. (2016) · ACM SIGARCH Computer Architecture News · doi:10.1145/3007787.3001139 · Cited by 1,536
ShiDianNao: shifting vision processing closer to the sensor
Du, Z., Fasthuber, R., Chen, T., Ienne, P., Li, L., Luo, T., Feng, X., Chen, Y., & Temam, O. (2015) · Proceedings of the 42nd Annual International Symposium on Computer Architecture · doi:10.1145/2749469.2750389 · Cited by 933
Neural Acceleration for General-Purpose Approximate Programs
Esmaeilzadeh, H., Sampson, A., Ceze, L., & Burger, D. (2012) · 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1109/micro.2012.48 · Cited by 626
Cnvlutin: ineffectual-neuron-free deep neural network computing
Albericio, J., Judd, P., Hetherington, T., Aamodt, T., Jerger, N. E., & Moshovos, A. (2016) · ACM SIGARCH Computer Architecture News · doi:10.1145/3007787.3001138 · Cited by 614
Self-citationCACTI 7: New Tools for Interconnect Exploration in Innovative Off-Chip Memories
Balasubramonian, R., Kahng, A. B., Muralimanohar, N., Shafiee, A., & Srinivas, V. (2017) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3085572 · Cited by 559
Computing in Memory With Spin-Transfer Torque Magnetic RAM
Jain, S., Ranjan, A., Roy, K., & Raghunathan, A. (2018) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2017.2776954 · Cited by 355
Hybrid cache architecture with disparate memory technologies
Wu, X., Li, J., Zhang, L., Speight, E., Rajamony, R., & Xie, Y. (2009) · Proceedings of the 36th annual international symposium on Computer architecture · doi:10.1145/1555754.1555761 · Cited by 333
Memory-centric accelerator design for Convolutional Neural Networks
Peemen, M., Setio, A. A. A., Mesman, B., & Corporaal, H. (2013) · 2013 IEEE 31st International Conference on Computer Design (ICCD) · doi:10.1109/iccd.2013.6657019 · Cited by 332
Google Workloads for Consumer Devices: Mitigating Data Movement Bottlenecks
Boroumand, A., Ghose, S., Kim, Y., Ausavarungnirun, R., Shiu, E., Thakur, R., Kim, D., Kuusela, A., Knies, A., Ranganathan, P., et al. (2018) · Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3173162.3173177 · Cited by 273
Practical Near-Data Processing for In-Memory Analytics Frameworks
Gao, M., Ayers, G., & Kozyrakis, C. (2015) · 2015 International Conference on Parallel Architecture and Compilation (PACT) · doi:10.1109/pact.2015.22 · Cited by 266
Metadata
- Authors
- Fung, W. W. L., Sham, I., Yuan, G., & Aamodt, T. M.
- Venue
- 40th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO 2007)
- Publisher
- IEEE
- Published
- 2007
- Pages
- 407-420
- ISSN
- 1072-4451 (ISSN-L)
- OpenAlex
- W2160428323
- Cited by
- 724
- References
- 22
- FWCI
- 20.93
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.