Demo Data from VLDB 2026 / reviewers in the wild / expert
Dimitris Lioupis
dblp:65/4770
· DBLP profile ↗
6ranked-venue papers
2as first author
0since 2021 · last 1998
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 5 · 2 first-authorSoftware engineering, systems software and programming languages · 2Computer networks · 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
2 papers |
Memory systems · 50% Processor architecture and microarchitecture · 45% Performance modeling and evaluation · 5% | |
| Computer networks
1 paper |
Internet architecture and protocols · 77% Optical networks · 12% Physical-layer communications · 12% |
Topics — the 13 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet architecture and protocols
integrated services |
0.0 | 1 | 1990 | The Cambridge Backbone Ring · INFOCOM 1990 |
Internet architecture and protocols › local area network
ring network |
0.0 | 1 | 1990 | The Cambridge Backbone Ring · INFOCOM 1990 |
Processor architecture and microarchitecture › multiprocessor architecture
bus-based multiprocessor |
0.0 | 1 | 1989 | Multiple vs. Wide Shared Bus Multiprocessors · ISCA 1989 |
Memory systems
cache coherence |
0.0 | 1 | 1989 | Multiple vs. Wide Shared Bus Multiprocessors · ISCA 1989 |
Processor architecture and microarchitecture
multiprocessor architecture |
0.0 | 1 | 1989 | Multiple vs. Wide Shared Bus Multiprocessors · ISCA 1989 |
Memory systems › cache coherence › cache coherence protocol
snoopy coherence |
0.0 | 1 | 1989 | Multiple vs. Wide Shared Bus Multiprocessors · ISCA 1989 |
Memory systems
cache |
0.0 | 1 | 1983 | Architecture of a VLSI Instruction Cache for a RISC · ISCA 1983 |
Memory systems › cache › CPU cache
instruction cache |
0.0 | 1 | 1983 | Architecture of a VLSI Instruction Cache for a RISC · ISCA 1983 |
Processor architecture and microarchitecture › instruction fetch
instruction fetch unit |
0.0 | 1 | 1983 | Architecture of a VLSI Instruction Cache for a RISC · ISCA 1983 |
Physical-layer communications › multiplexing
time-division multiplexing |
0.0 | 1 | 1990 | The Cambridge Backbone Ring · INFOCOM 1990 |
Optical networks
wavelength-division multiplexing |
0.0 | 1 | 1990 | The Cambridge Backbone Ring · INFOCOM 1990 |
Performance modeling and evaluation › simulation
simulation-based evaluation |
0.0 | 1 | 1989 | Multiple vs. Wide Shared Bus Multiprocessors · ISCA 1989 |
Processor architecture and microarchitecture › instruction set architecture
RISC |
0.0 | 1 | 1983 | Architecture of a VLSI Instruction Cache for a RISC · ISCA 1983 |
Methods — techniques the papers use, named apart from their topics
traffic simulation · 0.0simulation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1998 | Precise control of instruction cachesabstractInstruction caches are usually designed to fetch the whole block from memory in case of a miss. However, the fetched blocks might contain branch instructions which if taken, will render the rest of the block useless. A novel approach is introduced, namely the Precise Control, which fetches only the words of a cache block that are likely to be used. The performance of Precise Control is evaluated and it is shown that it has a positive influence on system performance. Precise Control reduces the words fetched from memory by up to 60%, thus reducing significantly the communication overhead between cache and main memory as well as the total execution time. Maria Smirli, Dimitris Lioupis, Kevin D. Kissell |
HiPC | 2 |
| 1997 | PiSMA: an upgradable fault tolerant approach to parallel processingabstractParallel processors reduce the communication overhead problem with the employment of some form of global communication network. This network however, imposes restrictions on the scalability and technological evolution of the parallel processor. In this paper a novel architecture called PiSMA (Parallel Virtual Shared Memory Architecture) is proposed, which consists of a basic substrate, without a network, providing neighborhood connectivity for local communication. The same architecture can be upgraded, by the addition of a global network. The simulated performance of such an upgradable parallel computer is measured with a wide range of parallel applications and fault tolerant issues are discussed. It is found that the substrate connectivity can provide an effective fault tolerant parallel computer for a large class of applications, while the incorporation of a global network broadens the spectrum of applications that can be executed efficiently by the PiSMA architecture. Dimitris Lioupis, Andreas Pipis, Michael Stefanidakis |
HiPC | 1 |
| 1993 | The memory hierarchy of the CHESS computer
Dimitris Lioupis, Nikos Kanellopoulos, Michalis Stefanidakis |
Microprocess. Microprogramming | 1 |
| 1990 | The Cambridge Backbone RingabstractAn experimental ring communication network, the Cambridge Backbone Ring, for integrated computer data, voice, and real-time video applications is described. The network is aimed as a backbone facility for interconnecting groups of Cambridge Fast Ring (CFR) networks in the Cambridge area. Media access control is through the empty slot technique, with transmitting stations filling multiple slots each ring revolution. The network operates on monomode optical fiber and is designed for an eventual line rate of 1000 Mb/s. In the backbone ring architecture, the bandwidth of the fiber-optic channel can be partitioned into a number (currently four) of time division multiplexing (TDM) channels. This enables stations of varying cost and bandwidth to be attached to one network, parameterized by the number of channels a station can use concurrently. The backbone ring architecture achieves full connectivity, even with the simplest type of station. Some brief traffic simulation results are presented.> David J. Greaves, Dimitris Lioupis, Andy Hopper |
INFOCOM | 2 |
| 1989 | Multiple vs. Wide Shared Bus MultiprocessorsabstractIn this paper we compare the simulated performance of a family of multiprocessor architectures based on a global shared memory. The processors are connected to the memory through caches that snoop one or more shared buses in crossbar arrangement. Andy Hopper, Dimitris Lioupis |
ISCA | 3 |
| 1983 | Architecture of a VLSI Instruction Cache for a RISCabstractA cache was first used in a commercial computer in 1968,1 and researchers have spent the last 15 years analyzing caches and suggesting improvements. In designing a VLSI instruction cache for a RISC microprocessor we have uncovered four ideas potentially applicable to other VLSI machines. These ideas provide expansible cache memory, increased cache speed, reduced program code size, and decreased manufacturing costs. These improvements blur the habitual distinction between an instruction cache and an instruction fetch unit. David A. Patterson 0001, Phil Garrison, Mark D. Hill, Dimitris Lioupis, Chris Nyberg, Tim Sippel, Korbin S. Van Dyke |
ISCA | 4 |