Works Published in 2011

search works

Displaying all 14 works

Sorted by most recent date added to the index first, which may not be the same as publication date order.

2011 chapter

Array Regrouping on CMP with Non-uniform Cache Sharing

In Languages and Compilers for Parallel Computing (pp. 92–105).

By: Y. Jiang*, E. Zhang*, X. Shen*, Y. Gao* & R. Archambault*

TL;DR: This work proposes cache-sharing-aware reference affinity analysis for identifying data affinity in multithreading applications that consists of affinity-guided thread scheduling and hierarchical reference-vector merging, handles cache sharing among both hyperthreads and cores, and offers hints for array regrouping and the avoidance of false sharing. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 10, 2020

2011 journal article

A Bayesian Model for Integrating Multiple Sources of Lifetime Information in System-Reliability Assessments

Journal of Quality Technology, 43(2), 127–141.

By: C. Reese*, A. Wilson*, J. Guo*, M. Hamada* & V. Johnson*

author keywords: Censored Data; Expert Opinion; Lifetime Data; Markov Chain Monte Carlo; Multicomponent System; Multilevel Data; Prior Information
TL;DR: A Bayesian model for assessing the reliability of multicomponent systems that allows pooling of information between similar components, the incorporation of expert opinion, and straightforward handling of censored data is presented. (via Semantic Scholar)
Source: Crossref
Added: September 9, 2020

2011 journal article

The Complexity of Optimal Job Co-Scheduling on Chip Multiprocessors and Heuristics-Based Solutions

IEEE Transactions on Parallel and Distributed Systems, 22(7), 1192–1205.

By: Y. Jiang*, K. Tian*, X. Shen*, J. Zhang n, J. Chen* & R. Tripathi*

author keywords: Co-scheduling; shared cache; CMP scheduling; cache contention; perfect matching; integer programming
TL;DR: The paper uncovers the computational complexity of the determination of optimal job co-schedules, proving its NP-completeness and introduces a set of algorithms, based on graph theory and Integer/Linear Programming, for computing optimal co- schedules or their lower bounds in scenarios with or without job migrations. (via Semantic Scholar)
UN Sustainable Development Goal Categories
8. Decent Work and Economic Growth (OpenAlex)
Sources: Crossref, NC State University Libraries
Added: September 6, 2020

2011 conference paper

On-the-fly elimination of dynamic irregularities for GPU computing

Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems - ASPLOS '11. Presented at the the sixteenth international conference.

By: E. Zhang*, Y. Jiang*, Z. Guo*, K. Tian* & X. Shen*

Event: the sixteenth international conference

TL;DR: G-Streamline is presented, as a unified software solution to dynamic irregularities in GPU computing, which treats both types of irregularities at the same time in a holistic fashion, maximizing the whole-program performance by resolving conflicts among optimizations. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 5, 2020

2011 conference paper

A step towards transparent integration of input-consciousness into dynamic program optimizations

Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications - OOPSLA '11. Presented at the the 2011 ACM international conference.

By: K. Tian*, E. Zhang* & X. Shen*

Event: the 2011 ACM international conference

TL;DR: Experiments on a number of Java programs demonstrate the effectiveness of the techniques in enabling input-consciousness for dynamic optimizations, revealing the feasibility and potential benefits of the new optimization paradigm in some basic settings. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 5, 2020

2011 conference paper

Correctly Treating Synchronizations in Compiling Fine-Grained SPMD-Threaded Programs for CPU

2011 International Conference on Parallel Architectures and Compilation Techniques. Presented at the 2011 International Conference on Parallel Architectures and Compilation Techniques (PACT).

By: Z. Guo*, E. Zhang* & X. Shen*

Event: 2011 International Conference on Parallel Architectures and Compilation Techniques (PACT)

TL;DR: A systematic dependence analysis specially designed for handling implicit synchronizations in SPMD-threaded programs is described, unveiling the relations between inter-thread data dependences and correct treatment to synchronizations and presents a dependence-based solution to the problem. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 5, 2020

2011 conference paper

Enhancing Data Locality for Dynamic Simulations through Asynchronous Data Transformations and Adaptive Control

2011 International Conference on Parallel Architectures and Compilation Techniques. Presented at the 2011 International Conference on Parallel Architectures and Compilation Techniques (PACT).

By: B. Wu*, E. Zhang* & X. Shen*

Event: 2011 International Conference on Parallel Architectures and Compilation Techniques (PACT)

TL;DR: This work examines the implications that modern heterogeneous Chip Multiprocessors (CMP) architecture imposes on the optimization paradigm, and develops three techniques to enhance the optimizations, including an asynchronous data transformation algorithm, named TLayout, designed specially to take advantage of modern throughput-oriented processors. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 5, 2020

2011 journal article

A mathematical analysis of the R-MAT random graph generator

Networks, 58(3), 159–170.

By: C. Groër*, B. Sullivan* & S. Poole*

Contributors: C. Groër*, B. Sullivan* & S. Poole*

author keywords: random graph; scale-free graph; R-MAT generator; occupancy problem
TL;DR: This article analyzes the graphs generated by R‐MAT and model the generator in terms of occupancy problems to prove results about the degree distributions of these graphs, and proves that the limiting degree distributions can be expressed as a mixture of normal distributions with means and variances. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries, ORCID
Added: February 5, 2020

2011 journal article

Quantifying reliability uncertainty from catastrophic and margin defects: A proof of concept

Reliability Engineering and System Safety, 96(9), 1063–1075.

By: C. Anderson-Cook*, S. Crowder*, A. Huzurbazar*, J. Lorio*, J. Ringland* & A. Wilson*

Contributors: C. Anderson-Cook*, S. Crowder*, A. Huzurbazar*, J. Lorio*, J. Ringland* & A. Wilson*

author keywords: Method of moments; Bayesian analysis; Bootstrap; System reliability; Catastrophic and margins failure modes
TL;DR: This paper provides proof of concept that uncertainty quantification methods can be constructed and applied to system reliability problems, and demonstrates that the results from the three fundamentally different approaches can be quite comparable. (via Semantic Scholar)
Source: ORCID
Added: December 7, 2019

2011 journal article

A case study for quantifying system reliability and uncertainty

Reliability Engineering and System Safety, 96(9), 1076–1084.

By: A. Wilson*, C. Anderson-Cook* & A. Huzurbazar*

Contributors: A. Wilson*, C. Anderson-Cook* & A. Huzurbazar*

author keywords: Bayesian; Multilevel data; Reliability block diagram; Monte Carlo
TL;DR: This paper provides a proof-of-concept that uncertainty quantification methods using Bayesian methodology can be constructed and applied to system reliability problems for a system with both series and parallel structures. (via Semantic Scholar)
Source: ORCID
Added: December 7, 2019

2011 journal article

Choosing a consumption strategy for a population of units based on reliability

Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability, 225(4), 407–423.

author keywords: probit regression; decision making; multiple competing objectives; stockpile management
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Source: ORCID
Added: December 7, 2019

2011 journal article

A random onset model for degradation of high-reliability systems

Technometrics, 53(2), 163–172.

By: S. Wiel*, T. Graves*, A. Wilson* & S. Reese*

Contributors: S. Wiel*, T. Graves*, A. Wilson* & S. Reese*

author keywords: Aging; Bayesian; Reliability uncertainty; Sampling; Surveillance planning
TL;DR: A model is presented, called RADAR, in which a stockpile has high initial reliability that may begin declining at any time, and provides a framework for answering questions about how confidence in continued high reliability can change as a result of reduced sampling, discovery of failed units, and information about when a unit failed. (via Semantic Scholar)
Source: ORCID
Added: December 7, 2019

2011 journal article

Assessing the risks of sampling rates for surveilling a population

Quality Engineering, 23(3), 242–252.

By: M. Hamada*, A. Huzurbazar*, S. Vander Wiel* & A. Wilson*

Contributors: M. Hamada*, A. Huzurbazar*, S. Vander Wiel* & A. Wilson*

author keywords: degradation data; detection probability; pass/fail data; trend detection
Source: ORCID
Added: December 7, 2019

2011 journal article

A Bayesian model for integrating multiple sources of lifetime information in system-reliability assessments

Journal of Quality Technology, 43(2), 127–141. http://www.scopus.com/inward/record.url?eid=2-s2.0-84857597234&partnerID=MN8TOARS

By: C. Shane Reese, A. Wilson, J. Guo, M. Hamada & V. Johnson

Contributors: C. Shane Reese, A. Wilson, J. Guo, M. Hamada & V. Johnson

Source: ORCID
Added: December 7, 2019

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.