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

13th IEEE Symposium on Computers and Communications

作者： Rizvi, Syed S. Elleithy, Khaled M. Riasat, Aasia Univ Bridgeport Dept Comp Sci & Engn Bridgeport CT 06601 USA Inst Business Management Dept Comp Sci Karachi Pakistan

ISBN: (纸本)9781424427024

Null message algorithm (NMA) is one of the efficient conservative time management algorithms that use null messages to provide synchronization between the logical processes (LPs) in a parallel discrete event simulation (PDES) system. However, the performance of a PDES system could be severely degraded if a large number of null messages need to be generated by LPs to avoid deadlock. In this paper, we present a mathematical model based on the quantitative criteria specified in [12] to optimize the performance of NMA by reducing the null message traffic. Moreover, the proposed mathematical model can be used to approximate the optimal values of some critical parameters such as frequency of transmission, Lookahead (L) values, and the variance of null message elimination. In addition, the performance analysis of the proposed mathematical model incorporates both uniform and non-uniform distribution of L values across multiple output lines of an LP. Our simulation and numerical analysis suggest that an optimal NMA offers better scalability in PDES system if it is used with the proper selection of critical parameters.

关键词： Conservative distributed simulation discrete event null messages parallel and distributed systems

来源：评论

学校读者我要写书评

暂无评论

parallel and distributed Kmeans to Identify the Translation Initiation Site of Proteins

Parallel and Distributed Kmeans to Identify the Translation ...

引用

IEEE International Conference on systems, Man, and Cybernetics (SMC)

作者： Rodrigues, Laerte M. Zarate, Luis E. Nobre, Cristiane N. Freitas, Henrique C. Pontificia Univ Catolica Minas Gerais Dept Comp Sci Belo Horizonte MG Brazil

ISBN: (纸本)9781467317146

Prediction of the translation initiation site is of vital importance in bioinformatics since through this process it is possible to understand the organic formation and metabolic behavior of living organisms. Sequential algorithms are not always a viable solution due to the fact that mRNA databases are normally very large, resulting in long processing times. Applying parallel and distributed computing resources to such databases could help reduce this time. The objective of this article is to present a class balancing solution for the translation initiation site process using parallel and distributed computing resources in a hybrid model. The results reveal a speedup of up to 23 times compared to sequential methods and performance rates for accuracy, precision, sensitivity, specificity and adjusted accuracy of 91.15%, 39.83%, 89.11%, 88.93% and 89.02%, respectively, for the Homo sapiens database. For the Drosophila melanogaster database, the speedup was 18.33 times and accuracy, precision, sensitivity, specificity and adjusted accuracy were 95.22%, 43.01%, 90.83%, 90.47% and 90.64%, respectively. Both sets of results are considered important. Thus, the solution presented in this article demonstrated itself viable for the problem in question.

关键词： parallel and distributed systems Bioinformatics Clustering

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Load Balancing Strategy with Adaptive Threshold Based Approach

A Dynamic Load Balancing Strategy with Adaptive Threshold Ba...

引用

2nd IEEE International Conference on parallel, distributed and Grid Computing (PDGC)

作者： Alam, Taj Raza, Zahid Jawaharlal Nehru Univ Sch Comp & Syst Sci New Delhi 110067 India

ISBN: (纸本)9781467329255

To meet the objective of mlnImlzmg the job execution time, parallel computing has to deal with a lot of issues which crop up while working with parallel code. These issues can result in bottleneck and restrict the behavior of parallel program in attaining an aforesaid speedup as suggested by Amdahl Gene. The most problematic issue that crops up is the distribution of workload in both the categories of parallel system viz. homogeneous and heterogeneous systems. This situation demands an effective load balancing strategy to be in place in order to ensure a uniform distribution of load across the board. The scheduling 'm' jobs to 'n' resources with the objective to optimize the QoS parameters while balancing the load has been proven to be NP-hard problem. Therefore, a heuristic approach can be used to design an effective load balancing strategy. In this paper, a centralized dynamic load balancing strategy using adaptive thresholds has been proposed for a parallel system consisting of multiprocessors. The scheduler continuously monitors the load on the system and takes corrective measures as the load changes. The threshold values considered are adaptive in nature and are readjusted to suite the changing load on the system. Therefore, the scheduler always ensures a uniform distribution of the load on the processing elements with dynamic load environment.

关键词： parallel and distributed systems load balancing threshold turnaround time central scheduling

来源：评论

学校读者我要写书评

暂无评论

Realizing Global Synchronizations for Locally-Connected Two-Dimensional Rectangle Cellular Arrays

Realizing Global Synchronizations for Locally-Connected Two-...

引用

26th IEEE International Conference on Advanced Information Networking and Applications (AINA)

作者： Umeo, Hiroshi Osaka Electrocommun Univ Neyagawa Osaka 5728530 Japan

ISBN: (纸本)9780769546513

Synchronization of large-scale networks is an important and fundamental computing primitive in parallel and distributed systems. The synchronization in cellular automata has been known as firing squad synchronization problem (FSSP) since its development. The FSSP has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms have been proposed so far. In the present paper, we give a survey on recent developments in FSSP algorithms for two-dimensional rectangle cellular automata. Several state-efficient new implementations of synchronization algorithms are also given.

关键词： parallel and distributed systems distributed processing cellular automaton FSSP firing squad synchronization problem parallel computing

来源：评论

学校读者我要写书评

暂无评论

parallel and distributed Kmeans to Identify the Translation Initiation Site of Proteins

Parallel and Distributed Kmeans to Identify the Translation ...

引用

IEEE International Conference on systems, Man, and Cybernetics

作者： Laerte M. Rodrigues Luis E. Zarate Cristiane N. Nobre Henrique C. Freitas Department of Computer Science Pontificia Universidade Catolica de Minas Gerais Department of Computer Science Universidade Federal de Sao Joao del-Rei

ISBN: (纸本)9781467317139

关键词： parallel and distributed systems Bioinformatics Clustering Translation Initiation parallel Lines Database Speeding Sensitivity and Specificity Proteins distributed energy resources Hybrid modes distributed computing Bioinformatics Anatomic Site Performance appraisal

来源：评论

学校读者我要写书评

暂无评论

auto-AID: A Data Mining Framework for Autonomic Anomaly Identification in Networked Computer systems

auto-AID: A Data Mining Framework for Autonomic Anomaly Iden...

引用

IEEE 29th International Performance Computing and Communications Conference

作者： Guan, Qiang Fu, Song Univ N Texas Dept Comp Sci & Engn Denton TX 76203 USA

ISBN: (纸本)9781424493289

Networked computer systems continue to grow in scale and in the complexity of their components and interactions. Component failures become norms instead of exceptions in these environments. A failure will cause one or multiple computer(s) to be unavailable, which affects the resource utilization and system throughput. When a computer fails to function properly, health-related data are valuable for trouble shooting. However, it is challenging to effectively identify anomalies from the voluminous amount of noisy, high-dimensional data. In this paper, we present auto-AID, an autonomic mechanism for anomaly identification in networked computer systems. It is composed of a set of data mining techniques that facilitates automatic analysis of system health data. The identification results are very valuable for the system administrators to manage systems and schedule the available resources. We implement a prototype of auto-AID and evaluate it on a production institution wide compute grid. The results show that auto-AID can effectively identify anomalies with little human intervention.

关键词： Anomaly identification Data mining System dependability parallel and distributed systems

来源：评论

学校读者我要写书评

暂无评论

Pipelining parallel image compositing and delivery for efficient remote visualization

引用

JOURNAL OF parallel AND distributed COMPUTING 2009年第3期69卷 230-238页

作者： Wu, Qishi Gao, Jinzhu Chen, Zizhong Zhu, Mengxia Univ Memphis Dept Comp Sci Memphis TN 38152 USA Univ Pacific Dept Comp Sci Stockton CA 95211 USA Colorado Sch Mines Dept Math & Comp Sci Golden CO 80401 USA So Illinois Univ Dept Comp Sci Carbondale IL 62901 USA

Scientific datasets of large volumes generated by next-generation computational sciences need to be transferred and processed for remote visualization and distributed collaboration among a geographically dispersed team of scientists. parallel visualization using high-performance computing facilities is a typical approach to processing such increasingly large datasets. We propose an optimized image compositing scheme with linear pipeline and adaptive transport to support efficient image delivery to a remote client. The proposed scheme arranges an arbitrary number of parallel processors within a cluster in a linear order and divides the image into a carefully selected number of segments, which flow through the linear incluster pipeline and wide-area networks to the remote client consecutively. We analytically determine the segment size that minimizes the final image display time and derive the conditions where the proposed image compositing and delivery scheme outperforms the traditional schemes including the binary swap algorithm. In order to match the transport throughput for image delivery over wide-area networks to the pipelining rate for image compositing within the cluster, we design a class of transport protocols using stochastic approximation methods that are able to stabilize the data flow at a target rate. The experimental results from remote visualization of large-scale scientific datasets justify the correctness of our theoretical analysis and illustrate the superior performances of the proposed method. (C) 2008 Elsevier Inc. All rights reserved.

关键词： Image compositing Pipelining Transport control Remote visualization parallel and distributed systems

来源：评论

学校读者我要写书评

暂无评论

Measuring robustness of computing systems

引用

SIMULATION MODELLING PRACTICE AND THEORY 2009年第9期17卷 1457-1467页

作者： Eslamnour, Behdis Ali, Shoukat Intel Corp Folsom CA 95630 USA Missouri Univ Sci & Technol Dept Elect & Comp Engn Rolla MO 65409 USA

System builders are becoming increasingly interested in robust design. We believe that a methodology for generating robustness metrics will help the robust design research efforts and, in general, is an important step in the efforts to create robust computing systems. The purpose of the research in this paper is to quantify the robustness of a resource allocation, with the eventual objective of setting a standard that could easily be instantiated for a particular computing system to generate a robustness metric. The paper exposes how not considering the uncertainties can result in gross overestimation of the system capacity, and shows a method for reducing the impact of uncertainty, and even use it to our advantage if the uncertainties are correlated. We present our theoretical foundation for a robustness metric and give its instantiation for a particular system. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Robustness Robustness metric Resource allocation Resource management systems parallel and distributed systems Mahalanobis distance

来源：评论

学校读者我要写书评

暂无评论

Highly Scalable Self-Healing Algorithms for High Performance Scientific Computing

引用

IEEE TRANSACTIONS ON COMPUTERS 2009年第11期58卷 1512-1524页

作者： Chen, Zizhong Dongarra, Jack Colorado Sch Mines Dept Math & Comp Sci Golden CO 80401 USA Univ Tennessee Dept Elect Engn & Comp Sci Knoxville TN 37996 USA

As the number of processors in today's high-performance computers continues to grow, the mean-time-to-failure of these computers is becoming significantly shorter than the execution time of many current high-performance computing applications. Although today's architectures are usually robust enough to survive node failures without suffering complete system failure, most of today's high-performance computing applications cannot survive node failures. Therefore, whenever a node fails, all surviving processes on surviving nodes usually have to be aborted and the whole application has to be restarted. In this paper, we present a framework for building self-healing high-performance numerical computing applications so that they can adapt to node or link failures without aborting themselves. The framework is based on FT-MPI and diskless checkpointing. Our diskless checkpointing uses weighted checksum schemes, a variation of Reed-Solomon erasure codes over floating-point numbers. We introduce several scalable encoding strategies into the existing diskless checkpointing and reduce the overhead to survive k failures in p processes from 2[log p].k((beta + 2 gamma)m + alpha) to (1 + O(root p/root m))(2).k(beta + 2 gamma)m, where alpha is the communication latency, 1/beta is the network bandwidth between processes, 1/gamma is the rate to perform calculations, and m is the size of local checkpoint per process. When additional checkpoint processors are used, the overhead can be reduced to (1 + O(root 1/m)).k(beta + 2 gamma)m, which is independent of the total number of computational processors. The introduced self-healing algorithms are scalable in the sense that the overhead to survive k failures in p processes does not increase as the number of processes p increases. We evaluate the performance overhead of our self-healing approach by using a preconditioned conjugate gradient equation solver as an example. Experimental results demonstrate that our self-healing scheme can surviv

关键词： Self-healing diskless checkpointing fault tolerance pipeline parallel and distributed systems high-performance computing Message Passing Interface

来源：评论

学校读者我要写书评

暂无评论

A new formalism for mathematical description and verification of component-based systems

引用

JOURNAL OF SUPERCOMPUTING 2009年第3期49卷 334-353页

作者： Isazadeh, Ayaz Karimpour, Jaber Univ Tabriz Dept Comp Sci Tabriz Iran

In this paper, we introduce a formal approach for composing software components into a distributed system. We describe the system as a hierarchical composition of some components, which can be distributed on a wide variety of hardware platforms and executed in parallel. We represent each component by a mathematical model and specify the abstract communication protocols of the components using Interface Automata (IAs). To model hierarchical systems, besides the basic components' model, we will present other components, called nodes. A node consists of a set of subnodes interacting under the supervision of a controller. Each subnode, in turn, is a node or discrete event component. By considering a subnode as a node we can make hierarchical nodes/components. The entire system, therefore, forms the root of the hierarchy. A controller, in turn, is a set of subcontrollers/interface automata that specifies interaction protocol of the components inside a node. We have also presented an example demonstrating the model by illustrating nodes, subnodes, controllers, and subcontrollers. To address the state space explosion problem in system verification, we utilize the controller as a contract for independent analysis of the components and their interactions. Therefore, a node will not be analyzed directly;instead, we will analyze the controller.

关键词： parallel and distributed systems Formal methods Interface automata Interacting components

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：