FRINK Linked Data Fragments server

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

• W2252715512 abstract "In order to achieve performance gains in the software, computers have evolvedto multi-core and many-core platforms abounding with multiple processor cores.However the problem of finding efficient ways to execute parallel software onthese platform is hard. With a large number of processor cores available, thesoftware must orchestrate the communication, synchronization along with theexecution of the code. Communication corresponds to the transport of databetween different processors, which either can be handled transparently by thehardware or explicitly managed by the software. Synchronization is arequirement of proper selection of start time of computations eg. the conditionfor software tasks to begin execution only after all its dependencies aresatisfied.Models which represent the algorithms in a structured and formal way expose theavailable parallelism. Deployment of the software algorithms represented bysuch models needs a specification of which processor to execute the tasks on(mapping) and when to execute them (scheduling). Mapping andscheduling is a hard combinatorial problem to solve with a huge design spacecontaining exponential number of solutions. In addition, the solutions areevaluated according to different costs that need to be optimized, such asmemory consumption, time to execute, static power consumption, resources usedetc. Such a problem with multiple costs is called a multi-criteriaoptimization problem. The solution to this problem is not a unique singlesolution, but a set of incomparable solutions called Pareto solutions.In order to track multi-criteria problems, special algorithms are needed whichcan approximate the Pareto solutions in the design space.In this thesis we target a class of applications called streamingapplications, which process a continuous stream of data. These applicationstypically apply similar computation on different data items. A common class ofmodels called dataflow models conveniently expresses such applications.In this thesis, we deal with mapping and scheduling of dataflow applications onmany-core platforms. We encode this problem in form of logical constraints andpresent it to satisfiability modulo theory (SMT) solvers. SMT solvers,solve the encoded problem by using a combination of search techniques andconstraint propagation to find an assignment to the problem variablessatisfying the given cost constraints.In dataflow applications, the design space explodes with increased number oftasks and processors. In this thesis, we tackle this problem by introducingsymmetry reduction techniques and demonstrate that symmetry breakingaccelerates search in SMT solvers, increasing the size of the problem that canbe solved. Our design-space exploration algorithm approximates the Pareto frontof the problem and produces solutions with different cost trade-offs. Wevalidate these solutions by executing them on a real multi-core platform.Further we extend the scheduling problem to the many-core platforms which areassembled from multi-core clusters connected by network-on-chip. We provide adesign flow which performs mapping of the applications on such platforms andautomatic insertion of additional elements to model the communication. Wedemonstrate how communication with bounded memory can be performed by correctlymodeling the flow-control. We provide experimental results obtained on the256-processor Kalray MPPA-256 platform.Multi-core processors have typically a small amount of memory close to theprocessor. Generally application data does not fit in the local memory. Westudy a class of parallel applications having a regular data access pattern,with large amount of data to be processed by a uniform computation. Suchapplications are commonly found in image processing. The data must be broughtfrom main memory to local memory, processed and then the results written backto main memory, all in batches. Selecting the proper granularity of the datathat is brought into local memory is an optimization problem. We formalize thisproblem and provide a way to determine the optimal transfer granularitydepending on the characteristics of application and the hardware platform.Further we provide a technique to analyze different data exchange mechanismsfor the case where some data is shared between different computations.Applications in modern embedded systems can start and stop dynamically. Inorder to execute all these applications efficiently and to optimize globalcosts such as power consumption, execution time etc., the applications must bereconfigured at runtime. We present a predictable and composable way (executingindependently without affecting others) of migrating tasks according to thereconfiguration decision." @default.
• W2252715512 created "2016-06-24" @default.
• W2252715512 creator A5035683509 @default.
• W2252715512 date "2014-10-13" @default.
• W2252715512 modified "2023-09-23" @default.
• W2252715512 title "Mapping and scheduling on multi-core processors using SMT solvers" @default.
• W2252715512 cites W1483521579 @default.
• W2252715512 cites W1490423772 @default.
• W2252715512 cites W1582450315 @default.
• W2252715512 cites W1595498733 @default.
• W2252715512 cites W1597755753 @default.
• W2252715512 cites W173895910 @default.
• W2252715512 cites W1793862799 @default.
• W2252715512 cites W1963547452 @default.
• W2252715512 cites W1968535060 @default.
• W2252715512 cites W1974183555 @default.
• W2252715512 cites W1974420955 @default.
• W2252715512 cites W1982838493 @default.
• W2252715512 cites W1983317091 @default.
• W2252715512 cites W1988888548 @default.
• W2252715512 cites W1993742654 @default.
• W2252715512 cites W1997576530 @default.
• W2252715512 cites W2006645291 @default.
• W2252715512 cites W2011737674 @default.
• W2252715512 cites W2012959791 @default.
• W2252715512 cites W2020322423 @default.
• W2252715512 cites W2021143721 @default.
• W2252715512 cites W2030346451 @default.
• W2252715512 cites W2031144446 @default.
• W2252715512 cites W2035171076 @default.
• W2252715512 cites W2050197389 @default.
• W2252715512 cites W2051598123 @default.
• W2252715512 cites W2052229697 @default.
• W2252715512 cites W2055649415 @default.
• W2252715512 cites W2057361103 @default.
• W2252715512 cites W2067840860 @default.
• W2252715512 cites W2069026418 @default.
• W2252715512 cites W2072162984 @default.
• W2252715512 cites W2079726719 @default.
• W2252715512 cites W2084588639 @default.
• W2252715512 cites W2084984944 @default.
• W2252715512 cites W2089155985 @default.
• W2252715512 cites W2099474000 @default.
• W2252715512 cites W2104922219 @default.
• W2252715512 cites W2110658529 @default.
• W2252715512 cites W2113281409 @default.
• W2252715512 cites W2114266730 @default.
• W2252715512 cites W2116182251 @default.
• W2252715512 cites W2118176463 @default.
• W2252715512 cites W2118245937 @default.
• W2252715512 cites W2123396057 @default.
• W2252715512 cites W2127059250 @default.
• W2252715512 cites W2128020218 @default.
• W2252715512 cites W2129037439 @default.
• W2252715512 cites W2131337712 @default.
• W2252715512 cites W2132536544 @default.
• W2252715512 cites W2133737198 @default.
• W2252715512 cites W2134850332 @default.
• W2252715512 cites W2140007372 @default.
• W2252715512 cites W2149345710 @default.
• W2252715512 cites W2152408640 @default.
• W2252715512 cites W2154056489 @default.
• W2252715512 cites W2156417042 @default.
• W2252715512 cites W2158359807 @default.
• W2252715512 cites W2159456929 @default.
• W2252715512 cites W2160642395 @default.
• W2252715512 cites W2161578546 @default.
• W2252715512 cites W2481787211 @default.
• W2252715512 cites W2615258659 @default.
• W2252715512 cites W2141657748 @default.
• W2252715512 cites W55478891 @default.
• W2252715512 hasPublicationYear "2014" @default.
• W2252715512 type Work @default.
• W2252715512 sameAs 2252715512 @default.
• W2252715512 citedByCount "6" @default.
• W2252715512 countsByYear W22527155122015 @default.
• W2252715512 countsByYear W22527155122017 @default.
• W2252715512 countsByYear W22527155122019 @default.
• W2252715512 countsByYear W22527155122020 @default.
• W2252715512 crossrefType "dissertation" @default.
• W2252715512 hasAuthorship W2252715512A5035683509 @default.
• W2252715512 hasConcept C120314980 @default.
• W2252715512 hasConcept C126255220 @default.
• W2252715512 hasConcept C127162648 @default.
• W2252715512 hasConcept C173608175 @default.
• W2252715512 hasConcept C199360897 @default.
• W2252715512 hasConcept C206729178 @default.
• W2252715512 hasConcept C2777904410 @default.
• W2252715512 hasConcept C2778562939 @default.
• W2252715512 hasConcept C31258907 @default.
• W2252715512 hasConcept C33923547 @default.
• W2252715512 hasConcept C41008148 @default.
• W2252715512 hasConcept C78766204 @default.
• W2252715512 hasConceptScore W2252715512C120314980 @default.
• W2252715512 hasConceptScore W2252715512C126255220 @default.
• W2252715512 hasConceptScore W2252715512C127162648 @default.
• W2252715512 hasConceptScore W2252715512C173608175 @default.
• W2252715512 hasConceptScore W2252715512C199360897 @default.
• W2252715512 hasConceptScore W2252715512C206729178 @default.
• W2252715512 hasConceptScore W2252715512C2777904410 @default.

• next