检索结果-内蒙古大学图书馆

Magnetic Field Analysis of Matrix-Rotor Induction Motor Using parallel computing system

IEEE TRANSACTIONS ON MAGNETICS 2011年第5期47卷 1062-1065页

作者： Kawase, Yoshihiro Yamaguchi, Tadashi Tsuji, Takeshi Tanaka, Ken Minoshima, Norimoto Hattori, Tatsuya Gifu Univ Dept Informat Sci Gifu 5011193 Japan Toyota Ind Corp Kyowa Plant Aichi 4748601 Japan

In this paper, a matrix-rotor induction motor is analyzed using the 3-D finite element method on a parallel computing system composed of 8 PCs. The static and the dynamic characteristics of the motor are numerically c... 详细信息

关键词： 3-D finite element method induction motor loss characteristics matrix-rotor parallel computing system

来源：评论

学校读者我要写书评

暂无评论

High-Performance computing Using Application of Q-determinant of Numerical Algorithms

High-Performance Computing Using Application of Q-determinan...

引用

Global Smart Industry Conference (GloSIC)

作者： Aleeva, Valentina N. Aleev, Rifkhat Zh. Natl Res Univ South Ural State Univ Chelyabinsk Russia

ISBN: (纸本)9781538673867

The conception of Q-determinant is one of the approaches to parallelizing numerical algorithms. The basic notion of the conception is Q-determinant of the algorithm. Here Q is the set of operations used by the algorithm. The Q-determinant consists of Q-terms. Their number is equal to the number of output data. Each Q-term describes all possible ways to calculate one of the output data based on the input data. Any numerical algorithm has a Q-determinant and can be represented in the form of a Q-determinant. This representation is a universal description of numerical algorithms. The representation algorithm in the form of Q-determinant makes the numerical algorithm in terms of the structure and implementation clearer. Although Q-determinant contains only machine-independent properties of the algorithm it can be used to implement algorithms on parallel computing systems. The paper describes the application of the Q-determinant to determine the parallelism resource of numerical algorithms and to develop Q-effective programs. A Q-effective program uses the parallelism resource of algorithm completely. At the present time the available theoretical results have been tested for numerical algorithms with various structures of Q-determinants. For example, they include multiplication algorithms for dense and sparse matrices, Gauss-Jordan, Jacobi, Gauss-Seidel methods for solving the systems of linear equations, the sweep method and the Fourier method for solving grid equations, and others. The results of the research can be used to increase the efficiency of implementing numerical algorithms on parallel computing systems.

关键词： Q-determinant of algorithm algorithm representation as Q-determinant Q-effective implementation of algorithm Q-effective program parallelism resource of algorithm parallel computing system parallel program

来源：评论

学校读者我要写书评

暂无评论

Magnetic Field Analysis of Matrix-Rotor Induction Motor Using parallel computing system

Magnetic Field Analysis of Matrix-Rotor Induction Motor Usin...

引用

14th Biennial IEEE Conference on Electromagnetic Field Computation (CEFC)

ISBN: (纸本)9781424470594

关键词： 3-D finite element method induction motor loss characteristics matrix-rotor parallel computing system

来源：评论

学校读者我要写书评

暂无评论

Optimal Path Embedding in the Exchanged Crossed Cube

引用

Journal of Computer Science & Technology 2017年第3期32卷 618-629页

作者： Dong-Fang Zhou Jian-Xi Fan Cheng-Kuan Lin Bao-Lei Cheng Jing-Ya Zhou Zhao Liu School of Computer Science and Technology Soochow University Suzhou 215006 China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing University Nanjing 210000 China

The （s＋t＋1）-dimensional exchanged crossed cube, denoted as ECQ（s, t）, combines the strong points of the exchanged hypercube and the crossed cube. It has been proven that ECQ（s, t） has more attractive properties than other variations of the fundamental hypercube in terms of fewer edges, lower cost factor and smaller diameter. In this paper, we study the embedding of paths of distinct lengths between any two different vertices in ECQ（s, t）. We prove the result in ECQ（s, t）： if s≥3, t≥3, for any two different vertices, all paths whose lengths are between max{9,「s＋1/2」＋「t＋1/2＋4}and 2s＋t＋1？1 can be embedded between the two vertices with dilation 1. Note that the diameter of ECQ（s, t） is「s＋1/2 」＋「t＋1/2 」＋2. The obtained result is optimal in the sense that the dilations of path embeddings are all 1. The result reveals the fact that ECQ（s, t） preserves the path embedding capability to a large extent, while it only has about one half edges of CQn.

关键词： interconnection network exchanged crossed cube path embedding parallel computing system

来源：评论

学校读者我要写书评

暂无评论

A t-level driven search for estimation of distribution algorithm in solving task graph allocation to multiprocessors 13

A t-level driven search for estimation of distribution algor...

引用

13th IEEE Conference on Automation Science and Engineering (IEEE CASE)

作者： Wu, Chu-ge Wang, Ling Wang, Jing-jing Tsinghua Univ Dept Automat Beijing 100084 Peoples R China

ISBN: (纸本)9781509067817

The development of cloud computing drives the research on parallel processing. One of the important problems in parallel processing is to minimize the makespan of the tasks with precedence constraints on multiprocessors scheduling. In this paper, the property of the t-level (top-level) is analyzed, and a t-level (top level) driven search is proposed to enhance the exploitation ability of the efficient estimation of distributed algorithm (eEDA), which was developed for solving the precedence constrained scheduling problem. Numerical tests and comparisons are carried out. The results demonstrate that the t-level driven search is able to improve the optimization capacity of the eEDA under heterogeneous multiprocessor situation. Moreover, it is also shown that the eEDA with the t-level driven search on homogeneous computing systems is effective.

关键词： t-level task graph allocation estimation of distribution algorithm parallel computing system

来源：评论

学校读者我要写书评

暂无评论

parallel resultant elimination algorithm to solve the selective harmonic elimination problem

引用

IET POWER ELECTRONICS 2016年第1期9卷 71-80页

作者： Yang, Kehu Chen, Liangyu Zhang, Jianjun Hao, Jun Yu, Wensheng China Univ Min & Technol Sch Mech Elect & Informat Engn Beijing Peoples R China E China Normal Univ Shanghai Key Lab Trustworthy Comp Shanghai Peoples R China Beijing Univ Posts & Telecommun Sch Elect Engn Beijing Peoples R China

Although the resultant elimination method can get all the possible solutions for the selective harmonic elimination (SHE) problem without the selection of initial values, it still has some fatal shortcomings, such as the high computation burden and the huge memory consumption caused by the intermediate expression swell in the procedure of computing the symbolic determinant of the Sylvester matrix. On the basis of the principle of polynomial interpolation, an algorithm framework is proposed to compute the resultant polynomials, which contains the following two major steps: the evaluation of numerical interpolation points and the solution of linear equations. This approach avoids symbolic computing whose computation complexity is usually very high, furthermore, both of these two steps are suitable for parallel implementing which can speed up the computing tremendously. By using the extended n-dimensional Bjorck-Pereyra's algorithm, this algorithm framework is implemented on a parallel computing system, and it has been used to solve the SHE equations for two-level, three-level, and multilevel inverters. As all the possible solutions can be found by this algorithm, the optimal solutions which have the lowest total harmonic distortion can be identified. Experiment results verify the correctness and effectiveness of the proposed method.

关键词： parallel algorithms matrix algebra interpolation polynomials invertors power engineering computing harmonic distortion parallel resultant elimination algorithm selective harmonic elimination problem Sylvester matrix polynomial interpolation resultant polynomials parallel computing system multilevel inverters three-level inverters two-level inverters harmonic distortion

来源：评论

学校读者我要写书评

暂无评论

Software system for Maximal parallelization of Algorithms on the Base of the Conception of Q-determinant 13th

引用

13th International Conference on parallel computing Technologies (PaCT)

作者： Aleeva, Valentina N. Sharabura, Ilya S. Suleymanov, Denis E. South Ural State Univ Chelyabinsk 454080 Russia

ISBN: (纸本)9783319219097;9783319219080

The development and the usage of parallel computing systems make it necessary to research parallelization resource of algorithms for search of the most rapid implementation. The algorithm representation as Q-determinant is one of the approaches that can be applied for that case. Such representation allows getting the most rapid possible implementation of the algorithm evaluates its performance complexity. Our work is to develop software system QStudio, which presents algorithm in the form of Q-determinant using the flowchart, finds the most rapid implementation of that one and builds an execution plan. The obtained results are oriented to ideal model of parallel computer system. However they can be a basis for automated execution of the most rapid algorithm implementations for real parallel computing systems.

关键词： Algorithm representation as Q-determinant parallelization algorithm Most rapid implementation of the algorithm Execution plan of the most rapid implementation parallel computing system

来源：评论

学校读者我要写书评

暂无评论

Educating Hardware Design - From Boolean Equations to Massively parallel computing systems 9

Educating Hardware Design - From Boolean Equations to Massiv...

引用

9th Southern Conference on Programmable Logic (SPL)

作者： Knodel, Oliver Zabel, Martin Lehmann, Patrick Spallek, Rainer G. Tech Univ Dresden Dept Comp Sci D-01062 Dresden Germany

ISBN: (纸本)9781479968480

The future of hardware development lies in massively parallel hardware architectures as used in embedded as well as high-performance systems, for instance streaming-based, real-time and database applications. Especially field-programmable gate arrays provide a platform for the rapid development of integrated circuits and the accompanied software. For reasons of energy efficiency, it is increasingly important to tailor hardware directly to the application. As such systems are very complex, the training of engineers has to start early. Furthermore, the usual curricula in computer science and electrical engineering teach only basic skills. In this paper we present lectures and especially practical FPGA design courses for bachelor and master students. We introduce a selection of individual projects, which were realized by students in practical courses. With examples from final bachelor projects and master theses we demonstrate the quality of education and its integration into current research. We describe possible improvements of labs, such as automated test benches and a remote FPGA laboratory for advanced courses.

关键词： Boolean algebra educational courses electronic engineering education embedded systems field programmable gate arrays further education logic design parallel architectures Boolean equations FPGA design courses advanced courses automated test benches bachelor students computer science education quality electrical engineering field-programmable gate arrays final bachelor projects hardware design hardware development high-performance systems integrated circuits massively parallel computing systems massively parallel hardware architecture master students master theses practical courses remote FPGA laboratory Computer architecture Computers Educational institutions Field programmable gate arrays Hardware system-on-chip Field programmable gate arrays computer hardware design Embedded systems Advanced Courses Continuing Education electrical engineering Computer hardware computer science system-on-chip parallel computing system parallel architectures Logic design Computer Architecture Boolean algebra Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Magnetic Field Analysis of Matrix-Rotor Induction Motor Using parallel computing system

Magnetic Field Analysis of Matrix-Rotor Induction Motor Usin...

引用

Biennial Institute of Electrical and Electronics Engineers Conference on Electomagnetic Field Computation

作者： Yoshihiro Kawase Tadashi Yamaguchi Takeshi Tsuji Ken Tanaka Norimoto Minoshima Tatsuya Hattori Department of Information Science Gifu University Toyota Industries Corporation

In this paper, a matrix-rotor induction motor is analyzed using the 3-D finite element method on a parallel computing system composed of 8 PCs. The torque and the loss characteristics of the motor are numerically clar... 详细信息

ISBN: (纸本)9781424470594

关键词： induction motors parallel computing system magnetic field Motor

来源：评论

学校读者我要写书评

暂无评论

Randomized Iterations for Low Latency Fixed Point Computation

Randomized Iterations for Low Latency Fixed Point Computatio...

引用

IEEE Annual Conference on Decision and Control

作者： Neal Master Nicholas Bambos Department of Electrical Engineering Stanford University Stanford CA 94305 USA

ISBN: (纸本)9781467360890

Many algorithms in numerical analysis, operations research, and control theory can be written as fixed point iterations of contraction maps. Because these algorithms are so pervasive, there is significant value in being able to perform these computations with lower computational latency. Previous work has focused on reducing the computational complexity of certain algorithms, but there has been less of a focus on using massively parallel computing systems to reduce computational latency. The rise of parallel computing systems makes this focus increasingly relevant as many traditional algorithms are incapable of fully utilizing such large-scale parallel processing power. We propose a randomized parallel algorithm which computes the fixed point of an arbitrary contraction map on R~n while making full use of large scale computing resources. When the number of processors grows exponentially with n, the proposed algorithm allows for a linear reduction in latency. Though this can also be said of a naive "brute-force" algorithm, the proposed algorithm is characterized by a much better linear factor. A numerical example is used to demonstrate this latency reduction while analytical proofs show this improvement holds in general. We conclude by discussing potential future work in specializing the proposed algorithm for specific applications as well in building a more general theory.

关键词： Fixed point Latency parallel computing system contraction mapping parallel PROCESSING (COMPUTERS) algorithms iterative methods virtual value Control Theory complexity classes

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：