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

Edmund J. Kelly

dblp:04/366 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 1995
—ORCID · none

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

Systems, architecture and hardware · 5Software 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
2 papers
Interconnection networks and networks-on-chip · 41% Processor architecture and microarchitecture · 20% Electronic design automation · 18%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › optical interconnection networks
optical fiber interconnection
0.011995
S-Connect: From Networks of Workstations to Supercomputer Performance · ISCA 1995
Electronic design automation › physical design
routing
0.011995
S-Connect: From Networks of Workstations to Supercomputer Performance · ISCA 1995
Interconnection networks and networks-on-chip › interconnect architecture
scalable interconnect
0.011995
S-Connect: From Networks of Workstations to Supercomputer Performance · ISCA 1995
Processor architecture and microarchitecture
instruction set architecture
0.011991
An Analysis of SPARC and MIPS Instruction Set Utilization on the SPEC Benchmarks · ASPLOS 1991
Processor architecture and microarchitecture › instruction set architecture
RISC
0.011991
An Analysis of SPARC and MIPS Instruction Set Utilization on the SPEC Benchmarks · ASPLOS 1991
Performance modeling and evaluation
workload characterization
0.011991
An Analysis of SPARC and MIPS Instruction Set Utilization on the SPEC Benchmarks · ASPLOS 1991
Memory systems › shared memory
distributed shared memory
0.011995
S-Connect: From Networks of Workstations to Supercomputer Performance · ISCA 1995
High-performance computing › cluster computing
network of workstations
0.011995
S-Connect: From Networks of Workstations to Supercomputer Performance · ISCA 1995
Interconnection networks and networks-on-chip › high-speed networks
supercomputer interconnect
0.011995
S-Connect: From Networks of Workstations to Supercomputer Performance · ISCA 1995
Compilers and program optimization
code generation
0.011991
An Analysis of SPARC and MIPS Instruction Set Utilization on the SPEC Benchmarks · ASPLOS 1991

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

dynamic instruction counting · 0.0optical fiber · 0.0in-band monitoring · 0.0distributed phase locking · 0.0
YearPublicationVenuePosition
1995 Exploiting Parallelism in Cache Coherency Protocol Engines
Andreas Nowatzyk, Gunes Aybay, Michael C. Browne, Edmund J. Kelly, Michael Parkin, Bill Radke, Sanjay Vishin
Euro-Par4
1995 The S3.mp Scalable Shared Memory Multiprocessor
Andreas Nowatzyk, Gunes Aybay, Michael C. Browne, Edmund J. Kelly, Michael Parkin, Bill Radke, Sanjay Vishin
ICPP (1)4
1995 S-Connect: From Networks of Workstations to Supercomputer Performance
abstract
S-Connect is a new high speed, scalable interconnect system that has been developed to support networks of workstations to efficiently share computing resources. It uses off-the-shelf CMOS technology to directly drive fiber-optic systems at speeds greater than 1 Gbit/sec and can realize bisection bandwidths comparable to high-end MPP systems while being >10x more cost-effective. S-Connect systems do not rely on centralized switches, but rather are composed of adaptive, topology independent routing elements that are integrated into each node. The S-Connect routing algorithm is optimized for fine grained, irregular traffic and is designed to support high traffic loads, that can utilize most of the physically available bandwidth. Such traffic is typical of a distributed shared memory system, which is one of the intended applications. S-Connect innovations include a novel distributed phase locking method that allows global synchronization, HW support for multiple message priorities, in-band monitoring and control facilities, and a low overhead channel protocol that supports multiple in-transit messages on the same fiber.The first version of the S-Connect switching element has been successfully implemented in a commercial, 0.65 µm CMOS process.
Andreas Nowatzyk, Michael C. Browne, Edmund J. Kelly, Michael Parkin
ISCA3
1993 The S3.mp Architecture: A Local Area Multiprocessor
abstract
No abstract available.
Andreas Nowatzyk, M. Monger, Michael Parkin, Edmund J. Kelly, Michael C. Browne, Gunes Aybay
SPAA4
1991 An Analysis of SPARC and MIPS Instruction Set Utilization on the SPEC Benchmarks
abstract
Copyright 1991, Association for Computing Machinery, Inc. Reprinted by permission. This paper originally appeared in Proceedings of the Fourth International Conference on Architecture Support for Programming Languages and Operating Systems (ASPLOS), Santa Clara, California, April 8-11, 1991. The dynamic instruction counts on MIPS and SPARC are compared using the SPEC benchmarks. MIPS typically executes more user-level instructions than SPARC. This difference can be counted for by architectural differences, compiler differences, and library differences. The most significant differences are that SPARC's double-precision floating point load/store is an architectural advantage in the SPEC floating point benchmarks while MIPS's compare-and-branch instruction is an architectural advantage in the SPEC integer benchmarks. After the differences in the two architectures are isolated, it appears that although MIPS and SPARC each have strengths and weaknesses in their compilers and library routines, the combined effect of compilers and library routines does not give either MIPS or SPARC a clear advantage in these areas.
Robert F. Cmelik, Shing I. Kong, David R. Ditzel, Edmund J. Kelly
ASPLOS4