8 Hits in 5.3 sec

An Enhanced Static-List Scheduling Algorithm for Temporal Partitioning onto RPUs [chapter]

João M. P. Cardoso, Horácio C. Neto
2000 IFIP Advances in Information and Communication Technology  
The algorithm is based on an extension of the tradition al static-list scheduling that tailors it to resolve both scheduling and temporal partitioning.  ...  This paper presents a novel algorithm for temporal partitioning of graphs representing a behavioral description.  ...  Vestias for the fruitful comments about the annealing implementation.  ... 
doi:10.1007/978-0-387-35498-9_43 fatcat:mklsfxib7rgbddokhoy5yinesa

A Survey on Reconfigurable System-on-Chips

Hung Kiem Nguyen, Tu Xuan Tran
2018 REV Journal on Electronics and Communications  
The requirements for high performance and low power consumption are becoming more and more inevitable when designing modern embedded systems, especially for the next generation multi-mode multimedia or  ...  • Mapping Method answers the question how to find an optimal map for an application onto the SoC platform.  ...  The CMU performs the feasibility analysis, spatial mapping, temporal scheduling, generating configuration contexts and configuring the NoC before performing an application.  ... 
doi:10.21553/rev-jec.147 fatcat:zqjzktktbjh4los7luipp45cvy

Performance Improvement by Introducing Mobility in Wireless Communication Networks [article]

Hailong Huang
2017 arXiv   pre-print
We also design an algorithm for multiple mobile sinks to collect urgent sensory information within the allowed latency.  ...  For the latter case, we design data collection protocols for a single mobile sink which aim at balancing the energy consumption among sensor nodes to improve the network lifetime.  ...  The authors in [64] also considered MES problem and proposed a Partitioning-Based Scheduling (PBS) algorithm.  ... 
arXiv:1712.02436v1 fatcat:oa3pc2mrw5gjlf6hsbqavxvky4

A Finite Domain Constraint Approach for Placement and Routing of Coarse-Grained Reconfigurable Architectures

Rohit Saraswat
This dissertation presents a finite domain constraint-based, delay-aware placement and routing methodology targeting an FPOA.  ...  Scheduling, placement, and routing are important steps in Very Large Scale Integration (VLSI) design. Researchers have developed numerous techniques to solve placement and routing problems.  ...  for initializing scheduling algorithm.  ... 
doi:10.26076/36b8-6af5 fatcat:oyc7tpo37ndsxmh7wf2itncte4

Interactive volume ray tracing [article]

Gerd Marmitt, Universität Des Saarlandes, Universität Des Saarlandes
Another alternative is to speed up the ray tracing algorithm to make it competitive for volumetric visualization tasks.  ...  The second algorithm uses so-called Plücker coordinates, providing a fast incremental traversal for data sets consisting of tetrahedral or hexahedral primitives.  ...  Temporal splits must not partition the volume further, but instead partition the time step series.  ... 
doi:10.22028/d291-25931 fatcat:luilnr6xjja3pbfkbdkleqy4ja

Provision of Flexibility Services by Industrial Energy Systems

Julian Rominger
Short-term plant deployment, such as day-ahead scheduling, is an essential energy management tool for the costeffective provision of energy, i.e., electricity, heating, and cooling.  ...  A prerequisite for this scheduling is a forecast of the energy demands and a detailed modeling of energy devices, markets and contracts.  ...  In particular, I am grateful for the support and  ... 
doi:10.5445/ir/1000123041 fatcat:x7jtzluskzcl7olwswnsstd5ru

Proceedings of the 13th International Conference on Location-Based Services

We thank Brigitte Sonderegger for the recruitment of participants, our student assistants for support in the data collection and above all, our participants for their time and willingness to take part  ...  Technology Development," was supported by the MOLIT (The Ministry of Land, Infrastructure and Transport), Korea, under the national spatial information research program supervised by the KAIA (Korea Agency for  ...  They modify the penalty algorithm through a multi-level partitioning together with the penalization scheme for the route and its adjacent edges.  ... 
doi:10.5167/uzh-127276 fatcat:pq4zj44ta5cq7gx6lhvosh75ny

Managing Complex Variability in Automotive Software Product Lines with Subscoping and Configuration Links [article]

Mark-Oliver Reiser, Technische Universität Berlin, Technische Universität Berlin, Stefan Jähnichen
The first of these concepts provides means to partition a complex product line along the variability axis by excluding some variants from consideration, resulting in s [...]  ...  Based on this finding, two fundamental concepts for developing highly complex automotive product lines will be presented.  ...  The virtual representation of the RPU demonstrator is based on an ASCET model for the engine management system controlling the engine actuator.  ... 
doi:10.14279/depositonce-2087 fatcat:s6l4muzrljebzotvhfym5zgtpe