Sciweavers

113 search results - page 1 / 23
» Data memory minimization by sharing large size buffers
Sort
View
ASPDAC
2000
ACM
120views Hardware» more  ASPDAC 2000»
13 years 9 months ago
Data memory minimization by sharing large size buffers
- This paper presents software synthesis techniques to deal with non-primitive data type from graphical dataflow programs based on the synchronous dataflow (SDF) model. Non-primiti...
Hyunok Oh, Soonhoi Ha
DAC
2002
ACM
14 years 5 months ago
Efficient code synthesis from extended dataflow graphs for multimedia applications
This paper presents efficient automatic code synthesis techniques from dataflow graphs for multimedia applications. Since multimedia applications require large size buffers contai...
Hyunok Oh, Soonhoi Ha
GLOBECOM
2006
IEEE
13 years 10 months ago
Shared-Memory Combined Input-Crosspoint Buffered Packet Switch for Differentiated Services
— Combined input-crosspoint buffered (CICB) packet switches with dedicated crosspoint buffers require a minimum amount of memory in the buffered crossbar of N2 × k × L, where N...
Ziqian Dong, Roberto Rojas-Cessa
HOTI
2005
IEEE
13 years 10 months ago
Long Round-Trip Time Support with Shared-Memory Crosspoint Buffered Packet Switch
— The amount of memory in buffered crossbars in combined input-crosspoint buffered switches is proportional to the number of crosspoints, or O(N2 ), where N is the number of port...
Ziqian Dong, Roberto Rojas-Cessa
ICC
2007
IEEE
165views Communications» more  ICC 2007»
13 years 11 months ago
Threshold-based Exhaustive Round-Robin for the CICQ Switch with Virtual Crosspoint Queues
A multi-cabinet implementation of a combined input and crosspoint queued (CICQ) switch introduces a large RTT latency between the line cards and switch fabric, requiring a large cr...
Kenji Yoshigoe