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

Santiago González Pestana

dblp:96/2776 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2006
—ORCID · none

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

Systems, architecture and hardware · 3 · 1 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
Cloud and datacenter computing · 61% Interconnection networks and networks-on-chip · 30% Parallel and multicore computing · 9%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › quality of service
guaranteed service
0.112005
An efficient on-chip NI offering guaranteed services, shared-memory abstraction, and flexible network configuration · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2005
Interconnection networks and networks-on-chip
network interface
0.112005
An efficient on-chip NI offering guaranteed services, shared-memory abstraction, and flexible network configuration · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2005
Cloud and datacenter computing
quality of service
0.112005
An efficient on-chip NI offering guaranteed services, shared-memory abstraction, and flexible network configuration · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2005
Parallel and multicore computing › parallel programming models
shared-memory abstraction
0.012005
An efficient on-chip NI offering guaranteed services, shared-memory abstraction, and flexible network configuration · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2005

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

transaction-based protocol · 0.1
YearPublicationVenuePosition
2006 An Integrated, Low-Power Processor for Image Signal Processing
abstract
The imaging market is developing at a high pace. Everywhere, new IC designs are started frequently to keep up with market demands and advanced applications. The Moustique-IC processor presented here is a complete, programmable solution that can reduce the number of silicon iterations by offering increased flexibility while maintaining the cost-effectiveness of a hardwired product. The processor is fully C-programmable, and scalable to keep up with market demands
Edwin van Dalen, Santiago González Pestana, Antoine van Wel
ISM2
2005 A Design Flow for Application-Specific Networks on Chip with Guaranteed Performance to Accelerate SOC Design and Verification
abstract
Systems on chip (SOC) are composed of intellectual property blocks (IP) and interconnect. While mature tooling exists to design the former, tooling for interconnect design is still a research area. In this paper we describe an operational design flow that generates and configures application-specific network on chip (NOC) instances, given application communication requirements. The NOC can be simulated in SystemC and RTL VHDL. An independent performance verification tool verifies analytically that the NOC instance (hardware) and its configuration (software) together meet the application performance requirements. The Æthereal NOC's guaranteed performance is essential to replace time-consuming simulation by fast analytical performance validation. As a result, application-specific NOCs that are guaranteed to meet the application's communication requirements are generated and verified in minutes, reducing the number of design iterations. A realistic MPEG SOC example substantiates our claims.
Kees Goossens, John Dielissen, Om Prakash Gangwal, Santiago González Pestana, Andrei Radulescu, Edwin Rijpkema
DATE4
2005 An efficient on-chip NI offering guaranteed services, shared-memory abstraction, and flexible network configuration
abstract
We present a network interface (NI) for an on-chip network. Our NI decouples computation from communication by offering a shared-memory abstraction, which is independent of the network implementation. We use a transaction-based protocol to achieve backward compatibility with existing bus protocols such as AXI, OCP, and DTL. Our NI has a modular architecture, which allows flexible instantiation. It provides both guaranteed and best-effort services via connections. These are configured via NI ports using the network itself, instead of a separate control interconnect. An example instance of this NI with four ports has an area of 0.25 mm/sup 2/ after layout in 0.13-/spl mu/m technology, and runs at 500 MHz.
Andrei Radulescu, John Dielissen, Santiago González Pestana, Om Prakash Gangwal, Edwin Rijpkema, Paul Wielage, Kees Goossens
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3
2004 Cost-Performance Trade-Offs in Networks on Chip: A Simulation-Based Approach
abstract
A challenge facing designers of systems on chip (SoC) containing networks on chip (NoC) is to find NoC instances that balance the cost (e.g. area) and performance (e.g. latency and throughput). In this paper we present a simulation-based approach to address this problem. We use XML to instantiate network components (routers, network interfaces) and their composition. NoCs are evaluated in terms of cost and performance by sweeping over different parameters (e.g. network topology, network interface queue depth). We then show, how we can obtain trade-off plots by using the results obtained with our simulation environment. Finally, by means of two examples we illustrate how trade-off plots can help the NoC designers in selecting the right network based on a set of different constraints.
Santiago González Pestana, Edwin Rijpkema, Andrei Radulescu, Kees Goossens, Om Prakash Gangwal
DATE1