Works Published in 2017
Displaying works 1 - 20 of 27 in total
Sorted by most recent date added to the index first, which may not be the same as publication date order.
2017 conference paper
Being even slightly shallow makes life hard
Leibniz International Proceedings in Informatics, LIPIcs, 83.
Contributors: I. Muzi *, . M.P. O'Brien, F. Reidl * & B. Sullivan n
TL;DR:
Dense $r/2$-Shallow Topological Minor and Dense £r-Subdivsion are already NP-hard for r = 1$ in very sparse graphs and do not admit algorithms with running time $2^{o(\mathbf{tw}^2)} n^{O(1)}$ when parameterized by the treewidth of the input graph for $r \geq 2$ unless ETH fails.
(via Semantic Scholar)
Source: ORCID
Added: August 6, 2022
2017 conference paper
A fast parameterized algorithm for Co-Path Set
Leibniz International Proceedings in Informatics, LIPIcs, 63.
Contributors: B. Sullivan n & A. Van Der Poel n
TL;DR:
A linear-time fpt algorithm with complexity O^*(1.588^k) for deciding k-CO-PATH SET is given, significantly improving the previously best known O*(2.17^ k) of Feng, Zhou, and Wang (2015).
(via Semantic Scholar)
Source: ORCID
Added: August 6, 2022
2017 conference paper
Asymptotic analysis of equivalences and core-structures in kronecker-style graph models
Proceedings - IEEE International Conference on Data Mining, ICDM, 829–834.
Contributors: A. Chin, T. Goodrich, . M.P. O'Brien, F. Reidl, B. Sullivan & A. Van Der Poel
Source: ORCID
Added: August 6, 2022
2017 article
Optimizing Adiabatic Quantum Program Compilation using a Graph-Theoretic Framework
ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85095056109&partnerID=MN8TOARS
Contributors: T. Goodrich, B. Sullivan & T. Humble
Source: ORCID
Added: August 6, 2022
2017 article
Being even slightly shallow makes life hard
ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85094429786&partnerID=MN8TOARS
Contributors: I. Muzi, . M.P. O'Brien, F. Reidl & B. Sullivan
Source: ORCID
Added: August 6, 2022
2017 article
An experimental evaluation of a bounded expansion algorithmic pipeline
ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85092949285&partnerID=MN8TOARS
Contributors: . M.P. O'Brien & B. Sullivan
Source: ORCID
Added: August 6, 2022
2017 article
A practical fpt algorithm for flow decomposition and transcript assembly
ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85094353595&partnerID=MN8TOARS
Contributors: K. Kloster, P. Kuinke, . M.P. O'Brien, F. Reidl, F. Villaamil, B. Sullivan , A. Van Der Poel
Source: ORCID
Added: August 6, 2022
2017 article
Walk entropy and walk-regularity
ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85094268676&partnerID=MN8TOARS
Contributors: K. Kloster, D. Král & B. Sullivan
Source: ORCID
Added: August 6, 2022
2017 chapter
Software-level task scheduling on GPUs
In Advances in GPU Research and Practice (pp. 83–103).
TL;DR:
This chapter presents a compiler and runtime framework with the capability to automatically transform and optimize GPU programs to enable controllable task scheduling to the streaming multiprocessors (SMs), which addresses the complexities of the hardware scheduler and provides the scheduling capability.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: December 7, 2020
2017 chapter
Data placement on GPUs
In Advances in GPU Research and Practice (pp. 105–123).
TL;DR:
This chapter discusses the complexity of GPU memory systems and describes a software framework named PORPLE to show how to automatically resolve the complexity for a given GPU program.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: December 7, 2020
2017 journal article
Bayesian assurance tests for degradation data
Quality and Reliability Engineering International, 33(8), 2699–2709.
author keywords: Bayesian inference; consumer's and producer's risks; Markov chain Monte Carlo; Monte Carlo integration; reliability
UN Sustainable Development Goal Categories
10. Reduced Inequalities
(OpenAlex)
Sources: Crossref, ORCID
Added: February 18, 2020
2017 conference paper
Efficient support of position independence on non-volatile memory
Proceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture - MICRO-50 '17. Presented at the the 50th Annual IEEE/ACM International Symposium.
Event: the 50th Annual IEEE/ACM International Symposium
author keywords: Compiler; Program Optimizations; Programming Languages; NVM
TL;DR:
Experiments show that the enabled representations provide much more efficient and flexible support of position independence for dynamic data structures, alleviating a major issue for effective data reuses on NVM.
(via Semantic Scholar)
dl.acm.org (publisher PDF)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Sources: Crossref, ORCID
Added: January 25, 2020
2017 conference paper
Versapipe
Proceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture - MICRO-50 '17. Presented at the the 50th Annual IEEE/ACM International Symposium.
Event: the 50th Annual IEEE/ACM International Symposium
author keywords: GPU; Pipelined Computing
TL;DR:
This paper proposes three new execution models equipped with much improved controllability, including a hybrid model that is capable of getting the strengths of all, and leads to the development of a software programming framework named VersaPipe.
(via Semantic Scholar)
Sources: Crossref, ORCID
Added: January 25, 2020
2017 conference paper
Egeria
Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis on - SC '17. Presented at the the International Conference for High Performance Computing, Networking, Storage and Analysis.
Event: the International Conference for High Performance Computing, Networking, Storage and Analysis
author keywords: program optimization; high performance computing; natural language processing
TL;DR:
This work develops a framework named Egeria, which can easily construct an advising tool for a certain high performance computing (HPC) domain by providing Egersia with a optimization guide or other related documents for the target domain, and provides a concise list of essential rules automatically extracted from the documents.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
4. Quality Education
(OpenAlex)
Sources: Crossref, ORCID
Added: January 25, 2020
2017 journal article
GLORE: generalized loop redundancy elimination upon LER-notation
Proceedings of the ACM on Programming Languages, 1(OOPSLA), 1–28.
author keywords: program optimization; loop redundancy elimination; operation minimization
TL;DR:
GLORE shows an applicability much broader than prior methods have, and frequently lowers the computational complexities of some nested loops that are elusive to prior optimization techniques, producing significantly larger speedups.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Sources: Crossref, ORCID
Added: January 25, 2020
2017 article
LCD: A Fast Contrastive Divergence Based Algorithm for Restricted Boltzmann Machine
2017 17TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), pp. 1015–1020.
TL;DR:
Lean Contrastive Divergence (LCD) is proposed, a modified contrastive divergence learning algorithm, to accelerate RBM learning and prediction without changing the results.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
3. Good Health and Well-being
(Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2017 article
Co-Run Scheduling with Power Cap on Integrated CPU-GPU Systems
2017 31ST IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), pp. 967–977.
TL;DR:
This paper presents the first systematic study on co-scheduling independent jobs on integrated CPU-GPU systems with power caps considered and offers several algorithms and a lightweight co-run performance and power predictive model for computing the performance bounds of the optimal co- schedules and finding appropriate schedules.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2017 conference paper
Generalizations of the theory and deployment of triangular inequality for compiler-based strength reduction
ACM SIGPLAN Notices, 52(6), 33–48.
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2017 conference paper
EffiSha: A software framework for enabling efficient preemptive scheduling of GPU
ACM SIGPLAN Notices, 52(8), 3–16.
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2017 conference paper
Bridging the gap between memory performance and massive parallelism: The critical role of programming systems innovations (keynote)
ACM SIGPLAN Notices, 52(9), 1–1.
Sources: NC State University Libraries, ORCID
Added: August 6, 2018
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
