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.

Aristides Nikologiannis

dblp:95/4686 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2007
—ORCID · none

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

Systems, architecture and hardware · 3Computer networks · 1Software engineering, systems software and programming languages · 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 · 28% Processor architecture and microarchitecture · 24% Performance modeling and evaluation · 22%

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

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture › special-purpose processor
network processor
0.122003
A fully-programmable memory management system optimizing queue handling at multi-gigabit rates · DAC 2003
System-level performance optimization of the data queueing memory management in high-speed network processors · DAC 2002
Embedded and real-time systems › real-time scheduling
queue management
0.012003
A fully-programmable memory management system optimizing queue handling at multi-gigabit rates · DAC 2003
Memory systems › memory management
dynamic memory management
0.012002
System-level performance optimization of the data queueing memory management in high-speed network processors · DAC 2002
Integrated circuit design
digital circuit design
0.012003
A fully-programmable memory management system optimizing queue handling at multi-gigabit rates · DAC 2003
Memory systems
DRAM
0.012003
A fully-programmable memory management system optimizing queue handling at multi-gigabit rates · DAC 2003
Memory systems › memory bandwidth
memory bandwidth optimization
0.012003
A fully-programmable memory management system optimizing queue handling at multi-gigabit rates · DAC 2003
Performance modeling and evaluation
high-speed packet processing
0.012002
System-level performance optimization of the data queueing memory management in high-speed network processors · DAC 2002

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

design space exploration · 0.0bank conflict analysis · 0.0
YearPublicationVenuePosition
2007 An Embedded Networking SoC for purely Ethernet MANs/WANs
abstract
Ethernet technology is lo longer used only in Local Area Networks (LANs); it is continuously gaining momentum in the Metropolitan Area Networks (MAN s) and Wide Area Networks (WANs). This paper presents a multi-service access concentrator core that has been designed specifically for multi-service, purely Ethernet, access nodes. In particular the presented system is optimised for Ethernet traffic aggregation over MPLS-based optical backbone networks. Moreover, we also demonstrate the bottlenecks that have been identified when such networking applications are executed in a general-purpose network processing device, and the techniques we used in order to bypass them. Our experiments results, executed in a state-of-the-art FPGA-based platform, strongly support that the combination of general purpose processing units with powerful specialized hardware modules, is the most cost-effective approach for designing systems that (i) can support today's and future network speeds and applications, in purely Ethernet networks, (ii) provide the end-user with the required programmability.
Theofanis Orphanoudakis, Ioannis Mavroidis, Aristides Nikologiannis, Ioannis Papaefstathiou
ISCC4
2005 Queue Management in Network Processors
abstract
One of the main bottlenecks when designing a network processing system is very often its memory subsystem. This is mainly due to the state-of-the-art network links operating at very high speeds and to the fact that in order to support advanced quality of service (QoS), a large number of independent queues is desirable. In this paper we analyze the performance bottlenecks of various data memory managers integrated in typical network processing units (NPU). We expose the performance limitations of software implementations utilizing the RISC processing cores typically found in most NPU architectures and we identify the requirements for hardware assisted memory management in order to achieve wire-speed operation at gigabit per second rates. Furthermore, we describe the architecture and performance of a hardware memory manager that fulfills those requirements. This memory manager, although it is implemented in a reconfigurable technology, can provide up to 6.2 Gbit/s of aggregate throughput, while handling 32 K independent queues.
Ioannis Papaefstathiou, Theofanis Orphanoudakis, Christoforos Kachris, Ioannis Mavroidis, Aristides Nikologiannis
DATE6
2003 A fully-programmable memory management system optimizing queue handling at multi-gigabit rates
abstract
Two of the main bottlenecks when designing a network embedded system are very often the memory bandwidth and its capacity. This is mainly due to the extremely high speed of the state-of-the-art network links and to the fact that in order to support advanced quality of service (QoS), per-flow queueing is desirable. In this paper we describe the architecture of a memory manager that can provide up to 10Gbs of aggregate throughput while handling 512K queues. The presented system supports a complete instruction set and thus we believe it can be used as a hardware component in any suitable embedded system, particularly network SoCs that implement per flow queuing. When designing this scheme several optimisation techniques have been evaluated and the most cost and performance effective ones used. These techniques minimize both the memory bandwidth and the memory capacity needed, which is considered a main advantage of the proposed scheme. The proposed architecture uses a simple DRAM for data storage and a typical SRAM for keeping data structures-pointers, therefore minimising the system's cost. The device has been fabricated within a novel programmable network processor designed for efficient protocol processing in high speed networking applications. It consists of 155K Gates and occupies 5.23 mm in UMC 0.18υ CMOS.
Ioannis Papaefstathiou, Aristides Nikologiannis, Nikolaos A. Zervos
DAC3
2002 System-level performance optimization of the data queueing memory management in high-speed network processors
abstract
In high-speed network processors, data queueing has to allow real-time memory (de)allocation, buffering, retrieving, and forwarding of incoming data packets. Its implementation must be highly optimized to combine high speed, low power, large data storage, and high memory bandwidth. In this paper, such data queueing is used as case study to demonstrate the effectiveness of a new system-level exploration method for optimizing the memory performance in dynamic memory management. Assuming that a multi-bank memory architecture is used for data storage, the method trades off bank conflicts against memory accesses during real-time memory (de)allocation. It has been applied to the data queueing module of the PRO3 system [8]. Compared with the conventional memory management technique for embedded systems, our exploration method can save up to 90% of the bank conflicts, which allows to improve worst-case memory performance of data queueing operations by 50% too.
Chantal Ykman-Couvreur, Jurgen Lambrecht, Diederik Verkest, Francky Catthoor, Aristides Nikologiannis, George E. Konstantoulakis
DAC5