Works Published in 2013
Displaying all 14 works
Sorted by most recent date added to the index first, which may not be the same as publication date order.
2013 conference paper
Parallel algorithms for graph optimization using tree decompositions
Proceedings - IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013, 1838–1847.
Contributors: B. Sullivan* , D. Weerapurage* & C. Groer*
TL;DR:
This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.
(via Semantic Scholar)
digital.library.unt.edu (repository)
Source: ORCID
Added: August 6, 2022
2013 journal article
On a conjecture of Andrica and Tomescu
Journal of Integer Sequences, 16(3). http://www.scopus.com/inward/record.url?eid=2-s2.0-84880061040&partnerID=MN8TOARS
Contributors: B. Sullivan
Source: ORCID
Added: August 6, 2022
2013 conference paper
Tree-Like Structure in Large Social and Information Networks
2013 IEEE 13th International Conference on Data Mining, 1–10.
Contributors: B. Sullivan n
TL;DR:
A detailed empirical analysis of the tree-like properties of realistic informatics graphs is performed using two very different notions of tree-likeness: Gromov's d-hyperbolicity and tree decompositions, tools from structural graph theory which measure how tree- like a graph is in terms of its cut structure.
(via Semantic Scholar)
Source: ORCID
Added: August 6, 2022
2013 journal article
Complexity analysis and algorithm design for reorganizing data to minimize non-coalesced memory accesses on GPU
ACM SIGPLAN Notices, 48(8), 57.
author keywords: Performance; Experimentation; GPGPU; Memory coalescing; Computational complexity; Thread-data remapping; Runtime optimizations; Data transformation
Sources: Crossref, NC State University Libraries
Added: December 7, 2020
2013 chapter
Fine-Grained Treatment to Synchronizations in GPU-to-CPU Translation
In Languages and Compilers for Parallel Computing (pp. 171–184).
TL;DR:
It is shown that careful dependence analysis may allow a fine-grained treatment to synchronizations and reveal redundant computation at the instruction-instance level and compared to existing translations, the new approach can yield speedup of a factor of integers.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 10, 2020
2013 chapter
Optimal Co-Scheduling to Minimize Makespan on Chip Multiprocessors
In Job Scheduling Strategies for Parallel Processing (pp. 114–133).
UN Sustainable Development Goal Categories
8. Decent Work and Economic Growth
(OpenAlex)
Sources: Crossref, NC State University Libraries
Added: September 10, 2020
2013 journal article
HPar
ACM Transactions on Architecture and Code Optimization, 10(4), 1–25.
TL;DR:
This work develops, to the best of the authors' knowledge, the first pipelining and data-level parallel HTML parsers and demonstrates the feasibility of efficient, parallel HTML parsing for the first time and offers a set of novel insights for parallel HTML parse.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 6, 2020
2013 chapter
Simple Profile Rectifications Go a Long Way
In ECOOP 2013 – Object-Oriented Programming (pp. 654–678).
TL;DR:
Experiments show that the simple approach enhances the effectiveness of sampled profile-based FDO dramatically, increasing the average FDO speedup from 1.16X to 1.3X, around 92% of what full profiles can yield.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 5, 2020
2013 journal article
Adiabatic quantum programming: minor embedding with hard faults
Quantum Information Processing, 13(3), 709–729.
author keywords: Quantum computing; Adiabatic quantum optimization; Graph embedding; Fault-tolerant computing
TL;DR:
Algorithms for embedding arbitrary instances of the adiabatic quantum optimization algorithm into a square lattice of specialized unit cells are presented and are shown to be more resilient to faulty fabrics than naive embedding approaches.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: February 5, 2020
2013 chapter
Evaluating OpenMP Tasking at Scale for the Computation of Graph Hyperbolicity
In OpenMP in the Era of Low Power Devices and Accelerators: Vol. 8122 LNCS (pp. 71–83).
Contributors: A. Adcock*, B. Sullivan* , O. Hernandez * & M. Mahoney *
TL;DR:
It is found that multiple task levels permits finer grained tasks at runtime and results in better performance at scale than worksharing constructs in OpenMP 3.1.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
8. Decent Work and Economic Growth
(OpenAlex)
Sources: Crossref, NC State University Libraries, ORCID
Added: February 5, 2020
2013 article
Profmig: A framework for flexible migration of program profiles across software versions
Zhou, M., Wu, B., Ding, Y., & Shen, X. (2013, February). Proceedings of the 2013 IEEE/ACM International Symposium on Code Generation and Optimization (CGO).
TL;DR:
This paper begins a systematic exploration in cross-version program profile migration, which tries to effectively reuse the valid part of the behavior profiles of an old version of a software for a new version, and introduces ProfMig, a framework for flexible migrations of various profiles.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
10. Reduced Inequalities
(OpenAlex)
Source: ORCID
Added: December 31, 2019
2013 conference paper
Exploring Hybrid Memory for GPU Energy Efficiency through Software-Hardware Co-Design
Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques. Presented at the PACT, Edinburgh, Scotland.
Event: PACT at Edinburgh, Scotland on September 7-11, 2013
TL;DR:
The co-design approach helps tap into the full potential of hybrid memory for GPU without requiring dramatic hardware changes over previous designs, yielding 6% and 49% energy saving on average compared to pure DRAM and pure PCM respectively, and keeping performance loss less than 2%.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy
(OpenAlex)
Sources: ORCID, NC State University Libraries, NC State University Libraries
Added: December 31, 2019
2013 journal article
Bayesian nonparametric models for community detection
Technometrics, 55(4), 390–402.
Contributors: J. Guo*, D. Nordman* & A. Wilson n
TL;DR:
A series of Bayesian nonparametric statistical models for community detection in graphs model the probability of the presence or absence of edges within the graph to estimate the number and structure of communities from the data.
(via Semantic Scholar)
Sources: NC State University Libraries, ORCID, NC State University Libraries
Added: August 6, 2018
2013 journal article
Bayesian Methods for Estimating System Reliability Using Heterogeneous Multilevel Information
TECHNOMETRICS, 55(4), 461–472.
Contributors: J. Guo* & A. Wilson n
author keywords: Degradation data; Hierarchical model; Lifetime data; Multicomponent system
TL;DR:
A Bayesian approach for assessing the reliability of multicomponent systems using multilevel information is proposed and two models allow us to evaluate system, subsystem, and component reliability using multilesvel information.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
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.
