Prospect of Fine Grain Dynamic Memory Access Control with Profiling

2010 ◽  
Author(s):  
Dongkyun Ahn ◽  
Gyungho Lee
Keyword(s):  
Access Control ◽  
Memory Access ◽  
Dynamic Memory ◽  
Fine Grain

Dynamic Memory Access Control for Accelerating FPGA-based Image Processing

2021 ◽  
Vol 21 (1) ◽  
pp. 29-38
Author(s):  
Kenta Nishiguchi ◽  
Toshiyuki Inoue ◽  
Rei Yamazaki ◽  
Kazunori Ogohara ◽  
Akira Tsuchiya ◽  
...  
Keyword(s):  
Image Processing ◽  
Access Control ◽  
Memory Access ◽  
Dynamic Memory

Design and evaluation of fine‐grain‐mode transition method based on dynamic memory access analysing for variable stages pipeline processor

2013 ◽  
Vol 7 (1) ◽  
pp. 41-47
Author(s):  
Takahiro Sasaki ◽  
Tomoyuki Nakabayashi ◽  
Kazumasa Nomura ◽  
Kazuhiko Ohno ◽  
Toshio Kondo
Keyword(s):  
Memory Access ◽  
Mode Transition ◽  
Dynamic Memory ◽  
Fine Grain

A Storage Scheme for Fast Packet Buffers in Network Processor

2011 ◽  
Vol 403-408 ◽  
pp. 2628-2631
Author(s):  
Jiang Yi Shi ◽  
Kun Chen ◽  
Kang Li ◽  
Zhi Xiong Di
Keyword(s):  
Access Control ◽  
Memory System ◽  
Storage Management ◽  
Network Processor ◽  
Memory Access ◽  
The Internet ◽  
Internet Services ◽  
Network Bandwidth ◽  
Storage Scheme ◽  
Key Factor

With the Internet services increased explosively, the requirement for network bandwidth is rigorous. Upon the extraordinary development of process capability, Memory access control has become a key factor that impacts the performance of network processor. The paper proposed a storage management for fast packet buffers in network processor, which can enhance the utilization of bandwidth. Experiment results shows that this approach improved the rates of accessing to memory system in network processor remarkably.

Design of a dynamic memory access scheduler

2007 ◽  
Author(s):  
Jun Zheng ◽  
Kang Sun ◽  
Xuezeng Pan ◽  
Lingdi Ping
Keyword(s):  
Memory Access ◽  
Dynamic Memory

Image Compression By Speck With Reduced Memory

2015 ◽  
Vol 4 (2) ◽  
Author(s):  
Amanat Ali ◽  
Amir Athar Khan ◽  
Sanawer Alam ◽  
N. R. Kidwai
Keyword(s):  
Memory Access ◽  
Access Time ◽  
Portable Devices ◽  
State Table ◽  
Set Partitions ◽  
Dynamic Memory ◽  
Coding Efficiency ◽  
Linked List ◽  
Image Coder ◽  
Linked Lists

Reduced memory set partitioned embedded block (SPECK) image coder is proposed in this paper large run–time memory is required by the original SPECK algorithm due to use of linked lists, so it is unsuitable for memory constrained portable devices. In the proposed algorithm SPECK coder successfully replace the linked lists by fixed length state tables or markers, to keep track of set partitions and encoded information. The proposed algorithm neither uses any linked list nor any state table, therefore completely eliminating the use of any dynamic memory at the time of its execution. This also reduces the memory access time, thereby making it faster than the original SPECK, while retaining the embedded property and having coding efficiency close to original SPECK.

Sign in / Sign up

Export Citation Format

Share Document