Markov decision process (MDP) provides the foundations for a number of problems, such as artificial intelligence Studying, automated planning and reinforcement learning. MDP can be solved efficiently in theory. Howeve...
详细信息
ISBN:
(纸本)9783642030949
Markov decision process (MDP) provides the foundations for a number of problems, such as artificial intelligence Studying, automated planning and reinforcement learning. MDP can be solved efficiently in theory. However, for large scenarios, more investigations are needed to reveal practical algorithms. algorithms for solving MDP have a natural concurrency. In this paper, we present parallelalgorithms based on dynamic programming Meanwhile, the cost of computation and communication complexity of this method is analyzed. Moreover, experimental results demonstrate excellent speedups and scalability.
this conference proceedings consists of 121 papers. the following topics are dealt with: real time architectures and applications;neural network implementation and applications;parallelism and computational paradigms ...
详细信息
ISBN:
(纸本)0818621338
this conference proceedings consists of 121 papers. the following topics are dealt with: real time architectures and applications;neural network implementation and applications;parallelism and computational paradigms of the future;fault tolerance and reliability;performance measurement and evaluation;distributed database systems;parallel and distributed architectures;parallel and distributed algorithms and applications;distributed operating systems;algorithms for distributed operating systems;languages and environments;object-oriented systems;specification methodologies;software engineering;communications theory;recent advances in mobile digital radio;advanced topics in communications systems;digital communications;theory and applications of non-uniform sampling;fiber optics;frame relay networks;network management and standards;protocol design;network performance;local area networks;wide area and broadband networks;multimedia database systems;graphics and multimedia;computer aided design;deductive systems;expert system applications;and AI techniques and expert systems.
Scheduling algorithms published in the scientific literature are often difficult to evaluate or compare due to differences between the experimental evaluations in any two papers on the topic. Very few researchers shar...
详细信息
ISBN:
(纸本)9781467375894
Scheduling algorithms published in the scientific literature are often difficult to evaluate or compare due to differences between the experimental evaluations in any two papers on the topic. Very few researchers share the details about the scheduling problem instances they use in their evaluation section, the code that allows them to transform the numbers they collect into the results and graphs they show, nor the raw data produced in their experiments. Also, many scheduling algorithms published are not tested against a real processor architecture to evaluate their efficiency in a realistic setting. In this paper, we describe Mimer, a modular evaluation tool-chain for static schedulers that enables the sharing of evaluation and analysis tools employed to elaborate scheduling papers. We propose Schedeval that integrates into Mimer to evaluate static schedules of streaming applications under throughput constraints on actual target execution platforms. We evaluate the performance of Schedeval at running streaming applications on the Intel Single-Chip Cloud computer (SCC), and we demonstrate the usefulness of our tool-chain to compare existing scheduling algorithms. We conclude that Mimer and Schedeval are useful tools to study static scheduling and to observe the behavior of streaming applications when running on manycore architectures.
the solution of large-scale problems in Computational Science and Engineering relies on the availability of accurate, robust and efficient numerical algorithms and software that are able to exploit the power offered b...
详细信息
ISBN:
(纸本)9783642328206
the solution of large-scale problems in Computational Science and Engineering relies on the availability of accurate, robust and efficient numerical algorithms and software that are able to exploit the power offered by modern computer architectures. Such algorithms and software provide building blocks for prototyping and developing novel applications, and for improving existing ones, by relieving the developers from details concerning numerical methods as well as their implementation in new computing environments.
Scientific applications usually exhibit irregular patterns of execution and high resource usage. parallelarchitectures are a feasible solution to face these drawbacks, but porting software to parallel platforms means...
详细信息
this paper presents a path of parallelism exploitation in commercial programmable DSP processors. DSP processors have gained in their complexity and recently adopted some very sophisticated parallelism extraction tech...
详细信息
this paper presents a path of parallelism exploitation in commercial programmable DSP processors. DSP processors have gained in their complexity and recently adopted some very sophisticated parallelism extraction techniques, namely very long instruction word (VLIW) and SIMD designs. the intention is to show a development path of digital signal processors (DSP) and focuses on their features that allow parallelprocessing of algorithms.
In control of parallel robots, forward kinematics calculation is mainly required. In some studies, obtained equations are solved numerically with massive calculations that is not acceptable for control implementations...
详细信息
ISBN:
(纸本)9781665454520
In control of parallel robots, forward kinematics calculation is mainly required. In some studies, obtained equations are solved numerically with massive calculations that is not acceptable for control implementations. this paper introduces a new method to extract forward kinematics for a 3RRS robot. this method calculates the kinematics of passive joints with two separated equations, which can be solved to decrease the total computation demands. Also, a new weight compensation mechanism is proposed to improve the dynamic response by a linear pneumatic actuator placed between the ground and the end-effector. On the other hand, to use various control algorithms, the position of the rolling ball on the endeffector (moving platform) must be measured. this is performed using Convolutional Neural Networks (CNNs) as image processingalgorithms. Since the system must work quickly for a high-frequency task, the proposed image processing algorithm can provide the desired fast feedback. Experimental results reveal the merits of the above-described proposed modules.
In recent years, IoT devices have become widespread, and energy-efficient coarse-grained reconfigurable architectures (CGRAs) have attracted attention. CGRAs comprise several processing units called processing element...
详细信息
ISBN:
(纸本)9781665469586
In recent years, IoT devices have become widespread, and energy-efficient coarse-grained reconfigurable architectures (CGRAs) have attracted attention. CGRAs comprise several processing units called processing elements (PEs) arranged in a two-dimensional array. the operations of PEs and the interconnections between them are adaptively changed depending on a target application, and this contributes to a higher energy efficiency compared to general-purpose processors. the application kernel executed on CGRAs is represented as a data flow graph (DFG), and CGRA compilers are responsible for mapping the DFG onto the PE array. thus, mapping algorithms significantly influence the performance and power efficiency of CGRAs as well as the compile lime. this paper proposes POCOCO, a compiler framework for CGRAs that can use pre-optimized subgraph mappings. this contributes to reducing the compiler optimization task. To leverage the subgraph mappings, we extend an existing mapping method based on a genetic algorithm. Experiments on three architectures demonstrated that the proposed method reduces the optimization lime by 48%, on an average, for the best case of the three architectures.
the auction algorithm has been widely used to solve the bipartite graph matching problem and its parallel implementation is employed to find solutions in a reasonable computational time. Moreover, the new multicore ar...
详细信息
ISBN:
(纸本)9781538666142
the auction algorithm has been widely used to solve the bipartite graph matching problem and its parallel implementation is employed to find solutions in a reasonable computational time. Moreover, the new multicore architectures, besides its various cores, have a SIMD instruction set that can increase application performance when exactly the same operations are to be performed on multiple data objects. the aim of this paper is to efficiently execute the auction algorithm on these architectures. To achieve that, a vectorized version was implemented and evaluated. these versions were then run in parallel using the OpenMP library. Finally, to optimize the number of threads used during the execution, a malleable strategy is proposed and evaluated. Results show that the vectorized version outperforms the sequential one by a factor of 10, while the malleable vectorized version was able to adapt its execution to exploit the full potential of multicore architectures.
this article introduces a C++ template library dedicated at vectorizing algorithms for different target architectures: Multi-Target parallel Skeleton (MTPS). Skeletons describing the data structures and algorithms are...
详细信息
暂无评论