This paper proposes a novel over-the-air firmware updating model suitable for integration with Industry 4.0 factories. The model includes a state-of-the-art design of a wireless programmer device that remotely receive...
详细信息
The complexity and diversity of high-performance computer architectures have brought great challenges to parallel application development. Using DSL (Domain Specific Language) to achieve multi-platform automatic paral...
详细信息
Rank modulation is a technique for representing stored information in an ordered set of flash memory cells by a permutation that reflects the ranking of their voltage levels. In this paper, we consider two figures of ...
详细信息
Rank modulation is a technique for representing stored information in an ordered set of flash memory cells by a permutation that reflects the ranking of their voltage levels. In this paper, we consider two figures of merit that can be used to compare parallel programming algorithms for rank modulation. These two criteria represent different tradeoffs between the programming speed and the lifetime of flash memory cells. In the first scenario, we want to find the minimum number of programming rounds required to increase a specified cell-level vector ℓ 0 to a cell-level vector corresponding to a target rank permutation τ, with no restriction on the maximum allowable cell level. We derive lower and upper bounds on this number, denoted by t 1 *(τ, ℓ 0 ). In the second scenario, we seek an efficient programming strategy to achieve a cell-level vector ℓ(τ) consistent with the target permutation τ, such that the maximum cell level after programming is minimized. Equivalently, this strategy maximizes the number of information update cycles supported by the device before requiring a block erasure. We derive upper bounds on the minimum number of programming rounds required to achieve cell-level vector ℓ(τ), denoted by t 1 (τ, ℓ 0 ), and propose a programming algorithm for which the resultant number of programming rounds is close to t 2 *(τ, ℓ 0 ).
The purpose of the research presented in this paper is finding the best execution times for searching subgraph isomorphisms. For this was created the GR3 Algorithm, its design consisting of a combination of parallel P...
详细信息
The paper provides an overview of the amenability of applying modern parallel-programming techniques in order to improve the performance of iterative solvers for systems of linear equations. Various conveniences, but ...
详细信息
OpenMP supports parallel incremental development, and has become a mainstream parallel programming standard for shared memory systems. A parallel compiler running on multi-core DSP is designed for OpenMP programs. The...
详细信息
Task-parallel programs often enjoy deadlock freedom under certain restrictions, such as the use of structured join operations, as in Cilk and X10, or the use of asynchronous task futures together with deadlock-avoidin...
详细信息
Various programming methods are considered. Particular attention is paid to parallel programming, quantum computers and biocomputers. This attention is due to the fact that in recent years, high-performance computing ...
详细信息
We present dynamic control replication, a run-time program analysis that enables scalable execution of implicitly parallel programs on large machines through a distributed and efficient dynamic dependence analysis. Dy...
详细信息
The Luhn’s algorithm is the first line of defense in various e-commerce sites and is utilized to validate credit card numbers. With increase in usage of credit cards validation process also needs to be faster. This f...
详细信息
暂无评论