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

Safety Mechanism Design and Verification of Safety Computer parallel program

Chinese Journal of Electronics 2018年第6期27卷 1163-1169页

作者： ZHANG Yuzhuo HONG Chunhua CAO Yuan MA Lianchuan WEN Yinghong School of Electronic and Information Engineering Beijing Jiaotong University National Engineering Research Center of Rail Traffic Control System Beijing Jiaotong University

The extensive application of Commercial off-the-shelf(COTS) components into safety computers in train control systems has caused safety problems. Aiming at the parallel programs, a concurrent program safety management mechanism based on transactional memory is proposed. The proposed mechanism implements concurrent behaviors of the application in the safe policy. A verification framework based on invariant proof and parallel separation logic theory is designed and operating system operation semantics are given for mathematical reasoning and proving. An example of code execution process is demonstrated to explain the safety control process of concurrent safety mechanism. The results indicate that the program can meet the safety and reliability requirements of concurrent safety computer platforms.

关键词： Safety computer parallel program Transactional memory Invariant proof Concurrent separation logic

来源：评论

学校读者我要写书评

暂无评论

Scheduling tasks of a parallel program in two-processor systems with use of cellular automata

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 1998年第5-6期14卷 351-364页

作者： Seredynski, F Polish Acad Sci Inst Comp Sci PL-01237 Warsaw Poland

In this paper, a cellular automaton (CA) is proposed as a tool for designing distributed scheduling algorithms for allocating parallel program tasks in multiprocessor systems. For this purpose, a program graph is considered as a CA containing elementary automata interacting locally according to some rules. In the first phase of the algorithm, effective rules for the CA are discovered by a genetic algorithm. In the second phase, the CA works as a distributed scheduler. In this phase, for any initial allocation of tasks in a multiprocessor system, the CA-based scheduler finds an allocation minimizing the total execution time of the program in a given system topology. The effectiveness of the proposed scheduling algorithm is shown for a number of program graphs scheduled in a two-processor system. (C) 1998 Elsevier Science B.V. All rights reserved.

关键词： cellular automata scheduling tasks parallel program

来源：评论

学校读者我要写书评

暂无评论

Stochastic bounds for parallel program execution times with processor constraints

引用

IEEE TRANSACTIONS ON COMPUTERS 1997年第5期46卷 630-636页

作者： Li, KQ Dept. of Math. & Comput. Sci. State Univ. of New York New Paltz NY USA Abstract Authors References Cited By Keywords Metrics Similar Download Citation Email Print Request Permissions

A parallel program can be modeled as an acyclic directed graph. where a node represents a task, which is the smallest grain of computation to be assigned to a processor, and arcs stand for precedence (synchronization) constraints among the tasks. Due to different input data and unpredictable dynamic run time environments, the execution times of tasks as well as the entire program can be treated as random variables. In this paper, we develop some stochastic lower and upper bounds for parallel program execution times when there are limited processors. Such analysis can provide important information for job scheduling and resource allocation. For several typical classes of parallel programs, we derive very accurate closed form approximations for the bounds. Examples are also given to demonstrate the quality of the bounds derived.

关键词： execution time parallel program processor allocation stochastic bound task scheduling

来源：评论

学校读者我要写书评

暂无评论

Predicting HPC parallel program performance based on LLVM compiler

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2017年第2期20卷 1179-1192页

作者： Zhang, Weizhe Hao, Meng Snir, Marc Harbin Inst Technol Sch Comp Sci & Technol Harbin Peoples R China Univ Illinois Dept Comp Sci Champaign IL USA

Performance prediction of parallel program plays key roles in many areas, such as parallel system design, parallel program optimization, and parallel system procurement. Accurate and efficient performance prediction on large-scale parallel systems is a challenging problem. To solve this problem, we present an effective framework for performance prediction based on the LLVM compiler technique in this paper. We can predict the performance of a parallel program on a small amount of nodes of the target parallel system using this framework toned but not execute this parallel program on a corresponding full-scale parallel system. This framework predicts the performance of computation and communication components separately and combines the two predictions to achieve full program prediction. As for sequential computation, we first combine the static branch probability and loop trip count identification and propose a new instrumentation method to acquire the number of each instruction type. We then construct a test program to measure the average execution time of each instruction type. Finally, we utilize the pruning technique to convert a parallel program into a corresponding sequential program to predict the performance on only one node of the target parallel system. As for communication, we utilize the LogGP model to model point-to-point communication and the artificial neural network technique to model collective communication. We validate our approach by a set of experiments that predict the performance of NAS parallel benchmarks and CGPOP parallel application. Experimental results show that the proposed framework can accurately predict the execution time of parallel programs, and the average error rate of these programs is 10.86%.

关键词： parallel program Performance prediction Loop trip count Artificial neural network LLVM

来源：评论

学校读者我要写书评

暂无评论

Space-based parallel program design process with high-level communication channels

引用

JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS 2017年第4期40卷 347-354页

作者： Lee, Tsung Huang, Yao-Yi Natl Sun Yat Sen Univ Dept Elect Engn Kaohsiung Taiwan

In this research, we reduce design complexity of parallel programs by performing the design task at the high level. We devised a formalism of the parallel program design process to support space-based parallel program design. In this formalism, program designs are captured in entity spaces. Entity spaces, including data spaces, tasks, etc. can be subdivided and freely distributed into logical node clusters that are assigned to processes. We designed high-level communication channels for communication among divided subtasks in a parallel program for space-based communication integration. Supported program models range in single program multiple data, multiple program multiple data, and their hybrid model. We designed single-space and cross-space high-level communication channels with various communication topologies. They are specified externally and decoupled from a parallel program. This makes the program logical and easily designed and reused. A practical example is used for illustrating the design process.

关键词： parallel program middleware software engineering communication channel

来源：评论

学校读者我要写书评

暂无评论

Reproducing the behavior of a parallel program by using dataflow execution models

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 1997年第4期E80D卷 495-503页

作者： Takahashi, N Miei, T NTT Software Lab Musashino-shi Japan

We present a general framework with which we can evaluate the flexibility and efficiency of various replay systems for parallel programs. In our approach, program monitoring is modeled by making a virtual dataflow program graph, referred to as a VDG, that includes all the instructions executed by the program. The behavior of the program replay is modeled on the parallel interpretation of a VDG based on two basic parallel execution models for dataflow program graphs: a data-driven model and a demand-driven model. Previous attempts to replay parallel programs, known as Instant Replay and P-Sequence, are also modeled as variations of the data-driven replay, i.e. the data-driven interpretation of a VDG. We show that the demand-driven replay, i.e, the demand-driven interpretation of a VDG, is more flexible in program replay than the data-driven replay since it allows better control of parallelism and a more selective replay. We also show that we can implement a demand-driven replay that requires almost the same amount of data to be saved during program monitoring as does the data-driven replay, and which eliminates any centralized bottleneck during program monitoring by optimizing the demand propagation and using an effective data structure.

关键词： parallel program distributed program program debugger execution monitoring dataflow computing

来源：评论

学校读者我要写书评

暂无评论

The Energy Efficiency Evaluating Method Determining Energy Consumption of the parallel program According to Its Profile

引用

LOBACHEVSKII JOURNAL OF MATHEMATICS 2020年第12期41卷 2542-2551页

作者： Kiselev, E. A. Kiselev, V. I. Shabanov, B. M. Aladyshev, O. S. Baranov, A. V. Russian Acad Sci Joint Supercomp Ctr Sci Res Inst Syst Anal Moscow 119334 Russia Russian Univ Transport MIIT Moscow 127994 Russia

The paper is devoted to the evaluation of energy efficiency of High Performance Computing systems used in a scientific supercomputer center. The authors propose a method for the comparison of energy efficiency of computing systems based on the power consumption and execution time of parallel programs. The paper presents a software tool that allows to determine the energy consumption profile of a parallel program automatically without changing its source code. The paper also presents the results of power consumption comparison of NAS parallel Benchmarks (BT, EP, IS, and LU) tests on computing systems with codenames Intel microprocessors Broadwell, Cascade Lake, Knights Landing and Skylake).

关键词： supercomputer energy efficiency power consumption profile parallel program high performance computing system HPC NAS parallel Benchmarks Intel

来源：评论

学校读者我要写书评

暂无评论

Development of parallel program of Two-dimensional Flow-sediment Mathematical Model for Long River Reach

Development of Parallel Program of Two-dimensional Flow-sedi...

引用

International Conference on Materials, Transportation and Environmental Engineering (CMTEE 2013)

作者： Wang Jianjun Tianjin Res Inst Water Transport Engn Tianjin 300456 Peoples R China

ISBN: (纸本)9783037858042

In order to meet technical requirements for systematic regulation to long reach of the Yangtze River, parallel program to computing core part of the software is developed based on TK-2DC software, which mainly contains parallelization research on flow convection diffusion model and sediment convection diffusion model. This parallel program conducts parallel programming on the basis of MPI. The whole parallel computing part adopts peer mode and corresponding special processing is performed to solving method of equation and special points so as to obtain better parallel speedup and parallel efficiency. parallel program has been tested by relying on channel regulation engineering related to Jingjiang reach in the middle reach of the Yangtze River. Test results shows that parallel efficiency with 8 CPU is up to 80% and parallel speedup can reach 4.98. Flow-sediment analog computing efficiency of long river reach is greatly improved.

关键词： Mathematical model Jingjiang reach parallel program

来源：评论

学校读者我要写书评

暂无评论

Reverse Engineering of Dynamic parallel program Behavior from Execution Traces 22

Reverse Engineering of Dynamic Parallel Program Behavior fro...

引用

22nd IEEE International Conference on parallel and Distributed Systems (ICPADS)

作者： Tsai, Shin-Chieh Chang, Chiu-Ping King, Chung-Ta Natl Tsing Hua Univ Dept Comp Sci Hsinchu Taiwan

ISBN: (纸本)9781509044573

Trace-driven simulation has been used widely for architectural exploitation in electronic system-level (ESL) designs for complex SoCs (system-on-chips). Most often the trace files are provided by third parties without source code. This makes it difficult to process and manipulate the trace files, e.g. to identify the region of interest (ROI), for efficient and more focused simulations. It is thus necessary to deduce high-level structures and patterns in the trace to facilitate such manipulations. This can be viewed as a reverse engineering process to derive the dynamic control flow of the original program from its execution trace. Furthermore, after the high-level structure is manipulated, it is also important to generate a new trace from the resultant structure that preserves the characteristics of the original trace for effective trace-driven simulations. The problem becomes even more difficult if the trace was generated from a parallel program because of the complex interactions between the multiple threads of executions. In this paper, a novel scheme to reverse-engineering the program execution trace is proposed, which can obtain the high-level dynamic control structure of the original parallel program as well as regenerate a similar trace from the derived structure, all without referencing the source code. The effectiveness of the proposed scheme is evaluated and verified with extensive experiments.

关键词： Execution traces finite-state machine parallel program reverse engineering trace-driven simulation

来源：评论

学校读者我要写书评

暂无评论

A Remote Debugging System for OpenMP parallel program

A Remote Debugging System for OpenMP Parallel Program

引用

International Conference on Transportation, Mechanical, and Electrical Engineering

作者： Hua Chai Qinqin Shi The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China

ISBN: (纸本)9781457717000

A remote debugging system for OpenMP parallel program is presented in this paper. The system consists of two parts, namely, an integrated debugging environment running on the clent-side and a background daemon running on the server-side. Information exchange between the two sides is accomplished through the socket-based network communication technology. The remote debugging function is realized by the automatic instrumentation technology at code level based on syntax tree. Instance tests show that the system can provide remote users with correctness checking, performance analysis and other debugging functions for OpenMP parallel programs. The user interface is simple and very easy to use.

关键词： parallel program OpenMP Remote Debugging Syntax Tree Instrumentation Technology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：