Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bradley D. McCredie

dblp:25/3088 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2Software engineering, systems software and programming languages · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
Energy-efficient computing · 70% Performance modeling and evaluation · 26% Parallel and multicore computing · 3%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Energy-efficient computing › power management › system-level power management
system-level power optimization
0.112009
From milliwatts to megawatts: system level power challenge · DAC 2009
Performance modeling and evaluation › simulation
discrete-event simulation
0.021988
Parallel Discrete Event Simulation Using Shared Memory · IEEE Trans. Software Eng. 1988
Parallel Discrete Event Simulation: A Shared Memory Approach · SIGMETRICS 1987
Performance modeling and evaluation › simulation › discrete-event simulation
parallel discrete event simulation
0.021988
Parallel Discrete Event Simulation Using Shared Memory · IEEE Trans. Software Eng. 1988
Parallel Discrete Event Simulation: A Shared Memory Approach · SIGMETRICS 1987
Performance modeling and evaluation › simulation › parallel and distributed simulation
parallel simulation
0.021988
Parallel Discrete Event Simulation Using Shared Memory · IEEE Trans. Software Eng. 1988
Parallel Discrete Event Simulation: A Shared Memory Approach · SIGMETRICS 1987
Performance modeling and evaluation
simulation
0.011988
Parallel Discrete Event Simulation Using Shared Memory · IEEE Trans. Software Eng. 1988
Parallel and multicore computing
shared memory simulation
0.011987
Parallel Discrete Event Simulation: A Shared Memory Approach · SIGMETRICS 1987
Performance modeling and evaluation › queueing models
queueing network model
0.011988
Parallel Discrete Event Simulation Using Shared Memory · IEEE Trans. Software Eng. 1988

Methods — techniques the papers use, named apart from their topics

chandy-misra distributed simulation · 0.0shared-memory synchronization · 0.0queueing networks · 0.0
YearPublicationVenuePosition
2009 From milliwatts to megawatts: system level power challenge
abstract
This panel discusses power optimization at the system level. What are the needs and opportunities? What are examples of successful practices? Can system-level power optimizations ever be automated? Can power optimizations be the enabling event for a methodology change in system-level design?
Ruchir Puri, Eshel Haritan, Stan Krolikoski, Jason Cong, Tim Kogel, Bradley D. McCredie, John Shen, Andrés Takach
DAC6
1988 Parallel Discrete Event Simulation Using Shared Memory
abstract
With traditional event-list techniques, evaluating a detailed discrete event simulation-model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the numbers of processors. A set of shared-memory experiments using the Chandy-Misra distributed simulation algorithm, to simulate networks of queues is presented. Parameters of the study include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential simulation of most queuing network models.>
Daniel A. Reed, Allen D. Malony, Bradley D. McCredie
IEEE Trans. Software Eng.3
1987 Parallel Discrete Event Simulation: A Shared Memory Approach
abstract
With traditional event list techniques, evaluating a detailed discrete event simulation model can often require hours or even days of computation time. Parallel simulation mimics the interacting servers and queues of a real system by assigning each simulated entity to a processor. By eliminating the event list and maintaining only sufficient synchronization to insure causality, parallel simulation can potentially provide speedups that are linear in the number of processors. A set of shared memory experiments is presented using the Chandy-Misra distributed simulation algorithm to simulate networks of queues. Parameters include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential simulation of most queueing network models.
Daniel A. Reed, Allen D. Malony, Bradley D. McCredie
SIGMETRICS3