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

A real-time performance evaluation model for distributed software with reliability constrains

JOURNAL OF SUPERCOMPUTING 2005年第2期34卷 165-179页

作者： Jin, H Xie, X Li, YF Han, ZF Dai, ZH Lu, P Huazhong Univ Sci & Technol Cluster & Grid Comp Lab Wuhan 430074 Peoples R China

In this paper, we propose an approach for the real-time performance analysis of distributed software with reliability constraints, called Athena. The approach is based on the real-time and reliability performance analysis of distributed program. In Athena, two important factors, imperfect nodes and the links reliability, are introduced. The algorithms proposed in Athena generates sub-graphs, counts the reliability of each sub-graph, calculates the transmission time for all the transmission paths of each data file, and computes response time of each data file with reliability constraint. In this way, the real-time performance of distributed software with reliability constrains can be evaluated.

关键词： distributed software reliability real-time performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Utility Accrual Dynamic Routing in real-time parallel systems

引用

IEEE TRANSACTIONS ON parallel AND distributed systems 2010年第12期21卷 1822-1835页

作者： Kargahi, Mehdi Movaghar, Ali Univ Tehran Sch Elect & Comp Engn Coll Engn Tehran Iran Inst Res Fundamental Sci IPM Sch Comp Sci Tehran Iran Sharif Univ Technol Dept Comp Engn Tehran Iran

One of the main properties of today's distributed and parallel systems, such as mobile ad-hoc networks and grids, is their heterogeneity in the available resources. Further, many applications of such systems are subject to time/Utility Function (TUF) time constraints for jobs, unavoidable variability in job characteristics and arrivals, and statistical assurance requirements on timeliness behaviors. In this paper, we propose an exact analytical solution for performance evaluation of dynamic policies used for routing of TUF-constrained Firm real-time (FRT) jobs among parallel single-processor queues with arbitrary processing rates and capacities. The analytical method can be used for the evaluation of the compliance of some important statistical assurance requirements. Furthermore, we present a utility-aware dynamic routing policy to improve the expected accrued utility of the parallel system. The policy called Maximum Expected Utility (MEU) behaves based on the information gathered from the analytical solution. MEU is compared with some well-known Dynamic Routing (DR) policies for different TUF shapes and both cases of homogeneous and heterogeneous processors of a two-queue system. The comparisons show the efficiency of MEU for the former case and its good behavior in most situations for the latter case.

关键词： Analytical modeling firm real-time systems performance modeling time/utility function utility accrual dynamic routing

来源：评论

学校读者我要写书评

暂无评论

parallel kernel solver of an FPGA-based real-time simulator for active distribution networks

引用

IET RENEWABLE POWER GENERATION 2023年第1期17卷 162-175页

作者： Li, Peng Wang, Xin Wang, Zhiying Fu, Xiaopeng Fu, Hao Wang, Kun Tianjin Univ Key Lab Smart Grid Minist Educ Tianjin 300072 Peoples R China

Field-programmable gate array (FPGA)-based real-time simulators are often applied in simulations of active distribution networks (ADNs) because of their parallel architectures and low cost. The overall performance of an FPGA-based real-time simulator is mainly determined by its kernel solver, which solves the nodal equation at each simulation time step. With the increasing scale of ADNs, real-time simulations of fast switching dynamics, along with limited computation hardware, have increased the requirements of the solver in terms of both time and resource consumption. In this study, a highly parallel kernel solver is proposed to improve the simulation efficiency of the FPGA-based real-time simulator. The multi-level parallel design and its implementation, including the parallelism at the system and module and element levels, are presented in detail. A modified IEEE 123-node system with distributed photovoltaics (PVs) is then simulated using a three-FPGA-based real-time simulator. Simulation results are compared with the commercial simulation tool PSCAD/EMTDC to validate the proposed kernel solver.

关键词： Distribution networks Solar power stations and photovoltaic power systems real-time simulations resource consumption three-FPGA-based real-time simulator distribution networks simulation efficiency parallel architectures field-programmable gate array-based real-time simulators distributed power generation field programmable gate arrays Logic circuits Power engineering computing Logic and switching circuits highly parallel kernel solver parallel architecture distributed power generation simulation time step active distribution networks

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant parallel algorithms for adaptive matched-field processing on distributed array systems

引用

JOURNAL OF COMPUTATIONAL ACOUSTICS 2005年第4期13卷 667-687页

作者： Cho, K George, AD Subramaniyan, R Univ Florida Dept Elect & Comp Engn Res Lab High Performance Comp & SimulatHCS Gainesville FL 32611 USA

Continuous innovations in adaptive matched-field processing (MFP) algorithms have presented significant increases in computational complexity and resource requirements that make development and use of advanced parallel processing techniques imperative. In real-time sonar systems operating in severe underwater environments, there is a high likelihood of some part of systems exhibiting defective behavior, resulting in loss of critical network, processor, and sensor elements, and degradation in beam power pattern. Such real-time sonar systems require high reliability to overcome these challenging problems. In this paper, efficient fault-tolerant parallel algorithms based on coarse-grained domain decomposition methods are developed in order to meet real-time and reliability requirements on distributed array systems in the presence of processor and sensor element failures. The performance of the fault-tolerant parallel algorithms is experimentally analyzed in terms of beamforming performance, computation time, speedup, and parallel efficiency on a distributed testbed. The performance results demonstrate that these fault-tolerant parallel algorithms can provide real-time, scalable, lightweight, and fault-tolerant implementations for adaptive MFP algorithms on distributed array systems.

关键词： cluster computing distributed computing fault-tolerant computing matching-field processing (MFP) minimum-variance distortionless response (MVDR) parallel computing

来源：评论

学校读者我要写书评

暂无评论

A PROCESSOR ARRAY MODULE FOR distributed, MASSIVELY-parallel, EMBEDDED COMPUTING

MICROPROCESSING AND MICROPROGRAMMING

引用

MICROPROCESSING AND MICROPROGRAMMING 1993年第1-5期38卷 529-537页

作者： BENGTSSON, L NILSSON, K SVENSSON, B HALMSTAD UNIV CTR COMP ARCHITECTURES-30118 HALMSTADSWEDEN CHALMERS UNIV TECHNOL DEPT COMP ENGNS-41296 GOTHENBURGSWEDEN

With the increased degree of miniaturization resulting from the use of modem VLSI technology and the high communication bandwidth available through optical connections, it is now possible to build massively parallel computers based on distributed modules which can be embedded in advanced industrial products. Examples of such future possibilities are ''action-oriented systems'', in which a network of highly parallel modules perform a multitude of tasks related to perception, cognition, and action. The paper discusses questions of architecture on the level of modules and inter-module communication and gives concrete architectural solutions which meet the demands of typical, advanced industrial real-time applications. The interface between the processors arrays and the all-optical communication network is described in some detail. Implementation issues specifically related to the demand for miniaturization are discussed.

关键词： parallel PROCESSING distributed EMBEDDED systems MASSIVE parallelISM LEARNING systems real-time COMPUTER systems OPTICAL COMMUNICATION

来源：评论

学校读者我要写书评

暂无评论

STATIC ANALYSIS OF real-time distributed systems

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1990年第4期16卷 373-388页

作者： LIU, LY SHYAMASUNDAR, RK TATA INST FUNDAMENTAL RES COMP SCI GRP BOMBAY 400005 INDIA PENN STATE UNIV DEPT COMP SCI UNIVERSITY PK PA 16802 USA

A static analysis for reasoning about the temporal behaviors of programs in real-time distributed programming languages is proposed. The analysis is based on the action set semantics using the pure maximal parallelism model. It is shown how to specify and verify various timing properties of real-time programs. The approach provides only an approximate timing behavior, because the state information is ignored. However, many interesting properties such as parallel actions, deadlocks, livelocks, terminations, temporal errors, and failures, can be identified. Furthermore, the approach is compositional and thus makes it possible to reason about the timing properties incrementally. The method not only leads to efficient algorithms for the static analysis of CSP programs but also applies to many other languages.

关键词： real-time systems Reasoning distributed systems Language real time distributed software

来源：评论

学校读者我要写书评

暂无评论

Issues in designing open distributed real-time databases 4

Issues in designing open distributed real-time databases

引用

4th International workshop on parallel and distributed real-time systems, WPDRTS 1996

作者： Ginis, Roman Wolfe, Victor Fay Department of Computer Science University of Rhode Island KingstonRI02881 United States

ISBN: (纸本)0818675152

关键词： Open systems

来源：评论

学校读者我要写书评

暂无评论

Allocating non-real-time and soft real-time jobs in multiclusters

引用

IEEE TRANSACTIONS ON parallel AND distributed systems 2006年第2期17卷 99-112页

作者： He, LG Jarvis, SA Spooner, DP Jiang, H Dillenberger, DN Nudd, GR Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England Univ Nebraska Dept Comp Sci & Engn Lincoln NE 68588 USA IBM Corp TJ Watson Res Ctr Yorktown Hts NY 10598 USA

This paper addresses workload allocation techniques for two types of sequential jobs that might be found in multicluster systems, namely, non-real-time jobs and soft real-time jobs. Two workload allocation strategies, the Optimized mean Response time (ORT) and the Optimized mean Miss Rate (OMR), are developed by establishing and numerically solving two optimization equation sets. The ORT strategy achieves an optimized mean response time for non-real-time jobs, while the OMR strategy obtains an optimized mean miss rate for soft real-time jobs over multiple clusters. Both strategies take into account average system behaviors (such as the mean arrival rate of jobs) in calculating the workload proportions for individual clusters and the workload allocation is updated dynamically when the change in the mean arrival rate reaches a certain threshold. The effectiveness of both strategies is demonstrated through theoretical analysis. These strategies are also evaluated through extensive experimental studies and the results show that when compared with traditional strategies, the proposed workload allocation schemes significantly improve the performance of job scheduling in multiclusters, both in terms of the mean response time (for non-real-time jobs) and the mean miss rate (for soft real-time jobs).

关键词： scheduling parallel systems distributed systems real-time systems numerical algorithms

来源：评论

学校读者我要写书评

暂无评论

Virtue: Performance visualization of parallel and distributed applications

引用

COMPUTER 1999年第12期32卷 44-+页

作者： Shaffer, E Reed, DA Whitmore, S Schaeffer, B Univ Illinois Dept Comp Sci Chicago IL 60680 USA

High-speed, wide-area networks have made it both possible and desirable to interconnect geographically distributed lections of scientific data, remote scientific instruments, and high-performance computer systems. Historically, performance analysis has focused on monolithic applications executing on large, stand-alone, parallel systems. In such a domain, measurement, postmortem analysis, and code optimization suffice to eliminate performance bottlenecks and optimize applications. distributed visualization, data mining, and analysis tools allow scientists to collaboratively analyze and understand complex phenomena. Likewise, real-time performance measurement and immersive performance display systems-that is, systems providing large stereoscopic displays of complex data-enable collaborating groups to interact with executing software, tuning its behavior to meet research and performance goals. To satisfy these demands, the authors designed Virtue, a prototype system that integrates collaborative, immersive performance visualization with real-time performance measurement and adaptive control of applications on computational grids. These tools enable physically distributed users to explore and steer the behavior of complex software in real time and to analyze and optimize distributed application dynamics.

关键词： Virtue adaptive application control collaborative data analysis tools collaborative immersive performance visualization complex phenomena computational grids computer displays data analysis data mining data mining distributed application dynamics optimization distributed applications distributed programming distributed visualization executing software groupware high-performance computer systems high-speed wide-area networks immersive performance display systems parallel applications performance analysis performance bottlenecks physically distributed users program visualisation prototype system real-time performance measurement real-time systems remote scientific instruments scientific data collections software performance evaluation software prototyping software tuning stereoscopic displays three-dimensional displays tuning virtual reality

来源：评论

学校读者我要写书评

暂无评论

time-bounded cooperative recovery with the distributed real-time conversation scheme

Time-bounded cooperative recovery with the distributed real-...

引用

3rd International workshop on Object-Oriented real-time Dependable systems

作者： Kim, KH Bacellar, L Univ of California Irvine United States

ISBN: (纸本)0818680474

Of several schemes proposed to handle the propagation of erroneous information among interacting processes in distributed and parallel computer systems, the distributed real-time conversation (DRC) scheme stands out in its fast forward recovery capability which is essential in safety-critical hard-real-time applications. However, previous formulations of the scheme remained at relatively abstract levels and practical models for their implementation in complex safety-critical real-time applications were not established before. The core approach in the DRC scheme is to make a group of computing stations cooperate in recovery from hardware and software faults that may occur during their interaction. In this paper we present a practical implementation model for the DRC scheme. A simple model of an anti-missile defense system is used to illustrate the main structuring principles of the DRC scheme and major components of the practical implementation model.

关键词： recovery block conversation distributed real-time conversation DRC distributed recovery block DRB safety-critical real-time cooperative recovery

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：