Results 241 to 250 of about 2,049,196 (301)
Some of the next articles are maybe not open access.
Mapping Filtering Streaming Applications
Algorithmica, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Agrawal, Kunal +3 more
openaire +2 more sources
HIERARCHICAL MAPPING FOR HPC APPLICATIONS
Parallel Processing Letters, 2011As the high performance computing systems scale up, mapping the tasks of a parallel application onto physical processors to allow efficient communication becomes one of the critical performance issues. Existing algorithms were usually designed to map applications with regular communication patterns.
Chung, I-Hsin +3 more
openaire +1 more source
MAPS: Mapping Concurrent Dataflow Applications to Heterogeneous MPSoCs
IEEE Transactions on Industrial Informatics, 2013Processor Systems on Chip (MPSoCs) in order to cope with the increasing applications demands and the tight energy budget of portable devices. The complexity of these systems makes them difficult to program, which has caused academia and industry to look for alternative methodologies and models.
Castrillon J., Leupers R., Ascheid G.
openaire +1 more source
A Protein Map and Its Application
DNA and Cell Biology, 2008Graphical representation of gene sequences provides a simple way of viewing, sorting, and comparing various gene structures. Here we first report a two-dimensional graphical representation for protein sequences. With this method, we constructed the moment vectors for protein sequences, and mathematically proved that the correspondence between moment ...
Stephen S-T, Yau +2 more
openaire +3 more sources
2017
Previously, a new class of distributed application run-time mapping algorithms called self-embedding was presented. They are not designed for hard real-time applications which require an upper bound for end-to-end latency. To achieve predictability or even *-predictability, a static (performance) analysis is inevitable to determine and optimize upper ...
Andreas Weichslgartner +3 more
openaire +1 more source
Previously, a new class of distributed application run-time mapping algorithms called self-embedding was presented. They are not designed for hard real-time applications which require an upper bound for end-to-end latency. To achieve predictability or even *-predictability, a static (performance) analysis is inevitable to determine and optimize upper ...
Andreas Weichslgartner +3 more
openaire +1 more source
SPIE Proceedings, 1988
Holography can be used for arbitrary, parallel, weighted mappings between planes with up to to 106 pixels each at I/O limited rates. This allows precalculated mappings to occur at very high speed. The applicarttions for one-to-one, one-to-many, many-to-one, and many-to-many maps are explored here.
openaire +1 more source
Holography can be used for arbitrary, parallel, weighted mappings between planes with up to to 106 pixels each at I/O limited rates. This allows precalculated mappings to occur at very high speed. The applicarttions for one-to-one, one-to-many, many-to-one, and many-to-many maps are explored here.
openaire +1 more source