Haggui et al., 2025 - Google Patents
Comparative Study of Memory Optimization Techniques for Dataflow-Modeled ApplicationsHaggui et al., 2025
View PDF- Document ID
- 1294249361244581284
- Author
- Haggui N
- Pelcat M
- Lee Y
- Bhattacharyya S
- Martin K
- Nezan J
- Publication year
- Publication venue
- International Workshop on Design and Architectures for Signal and Image Processing
External Links
Snippet
Efficient memory management is essential for signal and image processing systems, particularly in data-intensive applications where performance and resource constraints are critical. This paper presents a comparative study of two advanced memory optimization …
- 238000005457 optimization 0 title abstract description 31
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Programme initiating; Programme switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogramme communication; Intertask communication
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/30—Arrangements for executing machine-instructions, e.g. instruction decode
- G06F9/38—Concurrent instruction execution, e.g. pipeline, look ahead
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/30—Arrangements for executing machine-instructions, e.g. instruction decode
- G06F9/30003—Arrangements for executing specific machine instructions
- G06F9/3004—Arrangements for executing specific machine instructions to perform operations on memory
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0806—Multiuser, multiprocessor or multiprocessing cache systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/44—Arrangements for executing specific programmes
- G06F9/4421—Execution paradigms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/76—Architectures of general purpose stored programme computers
- G06F15/78—Architectures of general purpose stored programme computers comprising a single central processing unit
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
- G06F15/163—Interprocessor communication
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10977093B2 (en) | Declarative properties for data collections | |
| US9116738B2 (en) | Method and apparatus for efficient execution of concurrent processes on a multithreaded message passing system | |
| Thoman et al. | Celerity: High-level c++ for accelerator clusters | |
| Verdoolaege | Polyhedral process networks | |
| US9886328B2 (en) | Flexible binding of tasks to target resources | |
| US10437649B2 (en) | Task mapping for heterogeneous platforms | |
| Poeschel et al. | Transitioning from file-based HPC workflows to streaming data pipelines with openPMD and ADIOS2 | |
| US10572305B2 (en) | Multi-grained memory operands | |
| Koo et al. | IoT-enabled directed acyclic graph in spark cluster | |
| Arora | An introduction to big data, high performance computing, high-throughput computing, and hadoop | |
| Welch et al. | Extending openshmem with aggregation support for improved message rate performance | |
| Torres et al. | Supporting efficient overlapping of host-device operations for heterogeneous programming with CtrlEvents | |
| Haine et al. | A middleware supporting data movement in complex and software-defined storage and memory architectures | |
| Kim et al. | Optimal Model Partitioning with Low-Overhead Profiling on the PIM-based Platform for Deep Learning Inference | |
| Zaki et al. | Implementation, scheduling, and adaptation of partial expansion graphs on multicore platforms | |
| Haggui et al. | Comparative Study of Memory Optimization Techniques for Dataflow-Modeled Applications | |
| Lee et al. | Passive-active flowgraphs for efficient modeling and design of signal processing systems | |
| Genius et al. | Mapping a telecommunication application on a multiprocessor system-on-chip | |
| Wickramasinghe et al. | High‐performance iterative dataflow abstractions in Twister2: TSet | |
| Yang et al. | Demonstration on unblocking checkpoint for fault-tolerance in pregel-like systems | |
| Pugmire et al. | The adaptable io system (adios) | |
| Bandyopadhyay et al. | A scratchpad memory allocation scheme for dataflow models | |
| Martin et al. | Comparative Study of Memory Optimization Techniques for Dataflow-Modeled Applications | |
| Bloch et al. | Composite data types in dynamic dataflow languages as copyless memory sharing mechanism | |
| Corvino et al. | Design space exploration for efficient data intensive computing on socs |