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

Filipa Duarte

dblp:68/353 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
0since 2021 · last 2018
—ORCID · none

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

Systems, architecture and hardware · 7 · 4 first-authorApplied, interdisciplinary, general and emerging computing · 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
Hardware accelerators and domain-specific architectures · 53% Memory systems · 32% Parallel and multicore computing · 16%

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

TopicWeightPapersLastEvidence papers
Memory systems
cache
0.012010
Cache-Based Memory Copy Hardware Accelerator for Multicore Systems · IEEE Trans. Computers 2010
Memory systems › in-memory computing
in-cache acceleration
0.012010
Cache-Based Memory Copy Hardware Accelerator for Multicore Systems · IEEE Trans. Computers 2010
Parallel and multicore computing › parallel programming models
message passing
0.012010
Cache-Based Memory Copy Hardware Accelerator for Multicore Systems · IEEE Trans. Computers 2010

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

open queueing theory · 0.1full-system simulation · 0.1
YearPublicationVenuePosition
2018 SOCIAL Platform
Manuel Sousa, Luísa Arieira, Alexandra Queirós, Ana Isabel Martins, Nelson Pacheco da Rocha, Filipe Augusto, Filipa Duarte, Telmo Neves, António Damasceno
WorldCIST (2)7
2011 A 36μW heartbeat-detection processor for a wireless sensor node
abstract
In order to provide better services to elderly people, home healthcare monitoring systems have been increasingly deployed. Typically, these systems are based on wireless sensor nodes, and should utilize very low energy during their lifetimes, as they are powered by scavengers. In this article, we present an ultra-low power processing system for a wireless sensor node for very low duty cycle applications. In the CoolBio system-on-chip, we utilized several power reduction techniques at both the architecture level and the circuit level. These techniques include feature extraction, voltage and frequency scaling, clock and power gating and a redesign of key standard cells. In the design of the ultra-low power processing system, we paid special attention to the memory subsystem, as it is one of the most power-consuming modules in a design. We also designed a clock manager in order to reduce the power consumed by clocking, and a power manager that is able to power-off unutilized modules. The proposed wireless sensor node processing system consumes 36.4μW at 100MHz and 1.2V supply voltage, for a heartbeat-detection algorithm with a 0.01% duty cycle.
Filipa Duarte, Jos Hulzink, Jun Zhou 0017, Jan Stuijt, Jos Huisken, Harmke de Groot
ACM Trans. Design Autom. Electr. Syst.1
2010 Cache-Based Memory Copy Hardware Accelerator for Multicore Systems
abstract
In this paper, we present a new architecture of the cache-based memory copy hardware accelerator in a multicore system supporting message passing. The accelerator is able to accelerate memory data movements, in particular memory copies. We perform an analytical analysis based on open-queuing theory to study the utilization of our accelerator in a multicore system. In order to correctly model the system, we gather the necessary information by utilizing a full-system simulator. We present both the simulation results and the analytical analysis. We demonstrate the advantages of our solution based on a full-system simulator utilizing several applications: the STREAM benchmark and the receiver-side of the TCP/IP stack. Our accelerator provides speedups from 2.96 to 4.61 for the receiver-side of the TCP/IP stack, reduces the number of instructions from 26 percent to 44 percent and achieves a higher cache hit rate. Utilizing the analytical analysis, our accelerator reduces in the average number of cycles executed per instruction up to 50 percent for one of the CPUs in the multicore system.
Filipa Duarte, Stephan Wong
IEEE Trans. Computers1
2007 A memcpy Hardware Accelerator Solution for Non Cache-line Aligned Copies
abstract
In this paper, we presented a solution to perform non cache-line aligned operations using an additional indexing table in an existing cache organization. Our solution allows to be performed on word aligned data performs a of one word and of eight words (one cache-line), 66% and 69% faster than an optimized software implementation, respectively. The indexing table to the cache also avoids duplicating data in caches, because the copy (of the original data) is simply represented by inserting an additional pointer to the original data that is already present in the cache. This pointer allows the 'copied' data to be accessed from the cache. Our solution also offloads the processor as it is no longer required to perform the copies word by word (or the largest data unit the utilized architecture supports).
Filipa Duarte, Stephan Wong
ASAP1
2007 An OCM based shared Memory controller for Virtex 4
abstract
In this paper, we present a shared instruction and data memory controller for the On-Chip Memory (OCM) bus of the PowerPC embedded in the Virtex-4 chip. The traditional design of the memory controller is implemented on the Processor Local Bus (PLB), which is an undeterministic bus. Our design utilizes the OCM bus which is a dedicated memory bus. As such, the use of the OCM bus allows larger off-chip memories (compared to internal BRAMs) to be connected without the overhead of PLB arbitration. Moreover, our design is advantageous because its performance does not depend on the number of connected peripherals on the bus but merely on the delay of the connected DDR memory. Results indicate that, using the shared instruction and data memory controller on the OCM bus, introduces an improvement from 6% to 13% over the PLB based design.
Bas Breijer, Filipa Duarte, Stephan Wong
FPL2
2007 A Load/Store Unit for a Memcpy Hardware Accelerator
abstract
Recently, a dedicated hardware accelerator was proposed that works in conjunction with caches found next to modern-day microprocessors, to speedup the commonly utilized memcpy operation. The main assumption of the proposal was that the to-be-memcpy-ed data has to reside inside the cache, which is not always valid. In this paper, we present a dedicated load/store unit and its implementation which cooperates with the previously proposed memcpy hardware accelerator and cache to ensure that data becomes available in the cache. Experimental results, using synthetic benchmarks, show that the load/store unit in conjunction with the memcpy hardware accelerator is capable of reducing the memcpy latencies by 85% (when the data is not present in the cache) compared to a highly optimized, hand-coded in assembly software solution.
Stamatis Vassiliadis, Filipa Duarte, Stephan Wong
FPL2
2006 Profiling Bluetooth and Linux on the Xilinx Virtex II Pro
abstract
In this paper, we present profiling results of the Bluetooth standard implemented on the Xilinx Virtex II Pro device. The investigation is performed in two stages. First, we solely focus on the Bluetooth standard and its internal functions. Second, we focus on the Bluetooth standard in conjunction with an operating system. In both stages, we determine the most time-consuming junctions by pinpointing the most computationally intensive or most data-intensive functions. The results of the first stage show that there are eight most time-consuming functions within Bluetooth. The results of the second stage show that (excluding interrupt related functions) the most time-consuming function is memcpy. This function is called inside of the Bluetooth standard in order to move received packets to another memory location (allowing new packets to be copied to the same memory location) and to reassemble a frame with all the received packet., memcpy is also called within other standard Linux networking protocols which should similarly benefit from an hardware implementation of this junction
Filipa Duarte, Stephan Wong
DSD1
2006 A hardware cache memcpy accelerator
abstract
In this paper, we present a hardware solution to perform the commonly used memcpy operation with the goal to reduce the time to perform the actual memory copies. This is accomplished by taking advantage of the presence of a cache that is found next to many current-day (embedded) processors. Additionally, the currently presented solution assumes that to be copied data is already in the cache and is aligned by the cache-line size. We present the concept and implementation details of the proposed hardware module and the system used to experiment both our hardware and an optimized software implementation of the memcpy function. Experimental results show that the proposed hardware solution is at least 79% faster than an optimized hand-coded software solution
Stephan Wong, Filipa Duarte, Stamatis Vassiliadis
FPT2