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

Robert A. Snowdon

dblp:02/1456 · also Bob Snowdon, Robert Archer Snowdon, Robert Snowdon · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none

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

Software engineering, systems software and programming languages · 3 · 1 first-authorSystems, architecture and hardware · 1

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
1 paper
Memory systems · 67% Performance modeling and evaluation · 33%

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

TopicWeightPapersLastEvidence papers
Memory systems › memory architecture
interleaved memory
0.011971
On the Performance of Interleaved Memories with Multiple-Word Bandwidths · IEEE Trans. Computers 1971
Memory systems
memory bandwidth
0.011971
On the Performance of Interleaved Memories with Multiple-Word Bandwidths · IEEE Trans. Computers 1971
Performance modeling and evaluation › performance model construction
memory system performance modeling
0.011971
On the Performance of Interleaved Memories with Multiple-Word Bandwidths · IEEE Trans. Computers 1971

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

analytical modeling · 0.0
YearPublicationVenuePosition
2007 A framework for supporting dynamic systems co-evolution
Ronald Morrison, Dharini Balasubramaniam, Graham N. C. Kirby, Kath Mickan, Brian Warboys, Robert Mark Greenwood, Ian Robertson, Robert A. Snowdon
Autom. Softw. Eng.8
2004 Support for Evolving Software Architectures in the ArchWare ADL
abstract
Software that cannot evolve is condemned to atrophy: it cannot accommodate the constant revision and re-negotiation of its business goals nor intercept the potential of new technology. To accommodate change in software systems, we have defined an active software architecture to be: dynamic in that the structure and cardinality of the components and interactions are changeable during execution; updatable in that components can be replaced; decomposable in that an executing system may be (partially) stopped and split up into its components and interactions; and reflective in that the specification of components and interactions may be evolved during execution. Here we describe the facilities of the ArchWare architecture description language (ADL) for specifying active architectures. The contribution of the work is the unique combination of concepts including: a /spl pi/-calculus based communication and expression language for specifying executable architectures; hyper-code as an underlying representation of system execution that can be used for introspection; a decomposition operator to incrementally break up executing systems; and structural reflection for creating new components and binding them into running systems.
Ronald Morrison, Graham N. C. Kirby, Dharini Balasubramaniam, Kath Mickan, Flávio Oquendo, Sorana Cîmpan, Brian Warboys, Robert A. Snowdon, Robert Mark Greenwood
WICSA8
2003 Active meta-process models: a conceptual exposition
Robert A. Snowdon, Peter Kawalek
Inf. Softw. Technol.1
1971 On the Performance of Interleaved Memories with Multiple-Word Bandwidths
abstract
Past studies of the performance of interleaved memory systems are extended in this note by adopting a more general model. The model assumes a system of N memory modules, each of which is made up of b submodules. Successive memory addresses are assigned to sequential submodules, modulo Nb. For increased effective memory bandwidth a so-called conflict buffer of size L + 1 is assumed to exist for storing address conflicts.
Edward G. Coffman Jr., Gerald Jay Burnett, Robert A. Snowdon
IEEE Trans. Computers3