FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2103837157> ?p ?o ?g. }

• W2103837157 endingPage "494" @default.
• W2103837157 startingPage "477" @default.
• W2103837157 abstract "Many embedded systems such as digital cameras, digital radios, high-resolution printers, cellular phones, etc., involve a heavy use of signal processing and are thus based on digital signal processors (DSPs). DSPs such as the TMS320C2x and the DSP5600x have irregular data paths that typically result due to application specific needs (such as chaining multiply-accumulate operations, etc.). Efficient code generation for such embedded DSP processors is a challenging problem. The stringent requirements such as tight memory constraints and fast response time result in the need for a compact and efficient code. In this paper, we address the problem of generating a compact and efficient code for embedded DSP processors. Most of the DSP instruction set architectures (ISAs) feature intrainstruction parallelism (IIP), enabling individual operations to be executed in parallel by generating a complex instruction. A reduction in generated code size and improved performance can be achieved by exploiting this parallelism present in such ISAs. In this paper, we present a code restructuring technique to fully exploit this parallelism through maximal utilization of the complex instructions present in the instruction set. We formulate this as a maximal benefit code restructuring problem, which is to derive the arrangement of statements to maximally exploit IIP without violating data dependencies. This problem is equivalent to the precedence constrained Hamiltonian path problem for directed acyclic graphs and the traveling salesman problem in general, both of which are NP-hard. In this paper, we present an optimal algorithm to solve the problem. We have implemented this optimal algorithm in a compiler targeted to generate code for the TMS320C25 DSP. We tested our framework on a number of benchmarks and found that the performance of the generated code (measured in dynamic instruction cycle counts) improves by as much as 9.9% with an average of 4%. The average code-size reduction over code compiled without exploiting parallelism is 2.9%. We also studied the effect of loop unrolling on the available IIP. An on-chip instruction cache can be effectively utilized by unrolling loops such that generated code fully occupies the memory. The benefit is reduction in dynamic instruction count due to the higher number of complex instructions generated. We found that by unrolling loop by four times to fit available on-chip instruction cache, the dynamic instruction counts reduce by as much as 9.9 %." @default.
• W2103837157 created "2016-06-24" @default.
• W2103837157 creator A5011247429 @default.
• W2103837157 creator A5057117526 @default.
• W2103837157 creator A5061235810 @default.
• W2103837157 creator A5074250165 @default.
• W2103837157 date "2001-04-01" @default.
• W2103837157 modified "2023-10-17" @default.
• W2103837157 title "Compact and efficient code generation through program restructuring on limited memory embedded DSPs" @default.
• W2103837157 cites W1491178396 @default.
• W2103837157 cites W1518724533 @default.
• W2103837157 cites W1557490801 @default.
• W2103837157 cites W1601622917 @default.
• W2103837157 cites W1855084269 @default.
• W2103837157 cites W1971514468 @default.
• W2103837157 cites W1978090786 @default.
• W2103837157 cites W1985255904 @default.
• W2103837157 cites W1999095027 @default.
• W2103837157 cites W2009749048 @default.
• W2103837157 cites W2011039300 @default.
• W2103837157 cites W2023330569 @default.
• W2103837157 cites W2023335354 @default.
• W2103837157 cites W2025232768 @default.
• W2103837157 cites W2032570410 @default.
• W2103837157 cites W2056035103 @default.
• W2103837157 cites W2063255488 @default.
• W2103837157 cites W2086980357 @default.
• W2103837157 cites W2095641233 @default.
• W2103837157 cites W2106716308 @default.
• W2103837157 cites W2120525597 @default.
• W2103837157 cites W2122439715 @default.
• W2103837157 cites W2123516374 @default.
• W2103837157 cites W2128577609 @default.
• W2103837157 cites W2129962996 @default.
• W2103837157 cites W2131053190 @default.
• W2103837157 cites W2138133941 @default.
• W2103837157 cites W2150654370 @default.
• W2103837157 cites W2151635387 @default.
• W2103837157 cites W2294934420 @default.
• W2103837157 cites W436551700 @default.
• W2103837157 doi "https://doi.org/10.1109/43.918207" @default.
• W2103837157 hasPublicationYear "2001" @default.
• W2103837157 type Work @default.
• W2103837157 sameAs 2103837157 @default.
• W2103837157 citedByCount "4" @default.
• W2103837157 crossrefType "journal-article" @default.
• W2103837157 hasAuthorship W2103837157A5011247429 @default.
• W2103837157 hasAuthorship W2103837157A5057117526 @default.
• W2103837157 hasAuthorship W2103837157A5061235810 @default.
• W2103837157 hasAuthorship W2103837157A5074250165 @default.
• W2103837157 hasConcept C111919701 @default.
• W2103837157 hasConcept C133162039 @default.
• W2103837157 hasConcept C140763907 @default.
• W2103837157 hasConcept C161611012 @default.
• W2103837157 hasConcept C169590947 @default.
• W2103837157 hasConcept C173608175 @default.
• W2103837157 hasConcept C177264268 @default.
• W2103837157 hasConcept C199360897 @default.
• W2103837157 hasConcept C26517878 @default.
• W2103837157 hasConcept C2776760102 @default.
• W2103837157 hasConcept C2781172179 @default.
• W2103837157 hasConcept C41008148 @default.
• W2103837157 hasConcept C61483411 @default.
• W2103837157 hasConcept C84462506 @default.
• W2103837157 hasConcept C9390403 @default.
• W2103837157 hasConceptScore W2103837157C111919701 @default.
• W2103837157 hasConceptScore W2103837157C133162039 @default.
• W2103837157 hasConceptScore W2103837157C140763907 @default.
• W2103837157 hasConceptScore W2103837157C161611012 @default.
• W2103837157 hasConceptScore W2103837157C169590947 @default.
• W2103837157 hasConceptScore W2103837157C173608175 @default.
• W2103837157 hasConceptScore W2103837157C177264268 @default.
• W2103837157 hasConceptScore W2103837157C199360897 @default.
• W2103837157 hasConceptScore W2103837157C26517878 @default.
• W2103837157 hasConceptScore W2103837157C2776760102 @default.
• W2103837157 hasConceptScore W2103837157C2781172179 @default.
• W2103837157 hasConceptScore W2103837157C41008148 @default.
• W2103837157 hasConceptScore W2103837157C61483411 @default.
• W2103837157 hasConceptScore W2103837157C84462506 @default.
• W2103837157 hasConceptScore W2103837157C9390403 @default.
• W2103837157 hasIssue "4" @default.
• W2103837157 hasLocation W21038371571 @default.
• W2103837157 hasOpenAccess W2103837157 @default.
• W2103837157 hasPrimaryLocation W21038371571 @default.
• W2103837157 hasRelatedWork W1516292169 @default.
• W2103837157 hasRelatedWork W1547259518 @default.
• W2103837157 hasRelatedWork W1548505684 @default.
• W2103837157 hasRelatedWork W1567437828 @default.
• W2103837157 hasRelatedWork W1606391442 @default.
• W2103837157 hasRelatedWork W2023505575 @default.
• W2103837157 hasRelatedWork W2164503864 @default.
• W2103837157 hasRelatedWork W2354407271 @default.
• W2103837157 hasRelatedWork W2389852039 @default.
• W2103837157 hasRelatedWork W4240606930 @default.
• W2103837157 hasVolume "20" @default.
• W2103837157 isParatext "false" @default.
• W2103837157 isRetracted "false" @default.
• W2103837157 magId "2103837157" @default.

• next