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

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

来源：评论

学校读者我要写书评

暂无评论

Application skeletons: Construction and use in eScience

引用

FUTURE GENERATION COMPUTER systems-THE INTERNATIONAL JOURNAL OF ESCIENCE 2016年 59卷 114-124页

作者： Katz, Daniel S. Merzky, Andre Zhang, Zhao Jha, Shantenu Univ Chicago Computat Inst Chicago IL 60637 USA Argonne Natl Lab Chicago IL USA Rutgers State Univ RADICAL Lab New Brunswick NJ 08903 USA Univ Calif Berkeley AMPLab Berkeley CA 94720 USA

Computer scientists who work on tools and systems to support eScience (a variety of parallel and distributed) applications usually use actual applications to prove that their systems will benefit science and engineering (e.g., improve application performance). Accessing and building the applications and necessary data sets can be difficult because of policy or technical issues, and it can be difficult to modify the characteristics of the applications to understand corner cases in the system design. In this paper, we present the Application Skeleton, a simple yet powerful tool to build synthetic applications that represent real applications, with runtime and I/O close to those of the real applications. This allows computer scientists to focus on the system they are building;they can work with the simpler skeleton applications and be sure that their work will also be applicable to the real applications. In addition, skeleton applications support simple reproducible system experiments since they are represented by a compact set of parameters. Our Application Skeleton tool (available as open source at https://***/applicationskeleton/Skeleton) currently can create easy-to-access, easy-to-build, and easy-to-run bag-of-task, (iterative) map reduce, and (iterative) multistage workflow applications. The tasks can be serial, parallel, or a mix of both. The parameters to represent the tasks can either be discovered through a manual profiling of the applications or through an automated method. We select three representative applications (Montage, BLAST, CyberShake Postprocessing), then describe and generate skeleton applications for each. We show that the skeleton applications have identical (or close) performance to that of the real applications. We then show examples of using skeleton applications to verify system optimizations such as data caching, I/O tuning, and task scheduling, as well as the system resilience mechanism, in some cases modifying the skeleton applica

关键词： Computational science Data science Application modeling System modeling Performance modeling parallel and distributed systems

来源：评论

学校读者我要写书评

暂无评论

distributed PERFORMANCE MONITORING - METHODS, TOOLS, AND APPLICATIONS

引用

IEEE TRANSACTIONS ON parallel and distributed systems 1994年第6期5卷 585-598页

作者： HOFMANN, R KLAR, R MOHR, B QUICK, A SIEGLE, M Inst. fur Math. Maschinen Erlangen-Nurnberg Univ. Germany Institüt für Mathematics Maschinen Universität Erlangen-Nämberg Erlangen Germany

A method for analyzing the functional behavior and the performance of programs in distributed systems is presented. We use hybrid monitoring, a technique which combines advantages of both software monitoring and hardware monitoring. The paper contains a description of a hardware monitor and a software package (ZM4/SIMPLE) which make our concepts available to programmers, assisting them in debugging and tuning of their code. A short survey of related monitor systems highlights the distinguishing features of our implementation. As an application of our monitoring and evaluation system, the analysis of a parallel ray tracing program running on the SUPRENUM multiprocessor is described. It is shown that monitoring and modeling both rely on a common abstraction of a system's dynamic behavior and therefore can be integrated to one comprehensive methodology. This methodology is supported by a set of tools.

关键词： HARDWARE MONITORING HYBRID MONITORING EVENT-DRIVEN MONITORING INSTRUMENTATION MODELING PERFORMANCE EVALUATION DEBUGGING TUNING parallel and distributed systems SUPRENUM

来源：评论

学校读者我要写书评

暂无评论

MOVE: A distributed framework for materialized ontology view extraction

引用

ALGORITHMICA 2006年第3期45卷 457-481页

作者： Bhatt, Mehul Flahive, Andrew Wouters, Carlo Rahayu, Wenny Taniar, David La Trobe Univ Dept Comp Sci & Comp Engn Melbourne Vic 3086 Australia Monash Univ Sch Business Syst Clayton Vic 3800 Australia

The use of ontologies lies at the very heart of the newly emerging era of semantic web. Ontologies provide a shared conceptualization of some domain that may be communicated between people and application systems. As information on the web increases significantly in size, web ontologies also tend to grow bigger, to such an extent that they become too large to be used in their entirety by any single application. Moreover, because of the size of the original ontology, the process of repeatedly iterating the millions of nodes and relationships to form an optimized sub-ontology becomes very computationally extensive. Therefore, it is imperative that parallel and distributed computing techniques be utilized to implement the extraction process. These problems have stimulated our work in the area of sub-ontology extraction where each user may extract optimized sub-ontologies from an existing base ontology. The extraction process consists of a number of independent optimization schemes that cover various aspects of the optimization process, such as ensuring consistency of the user-specified requirements for the sub-ontology, ensuring semantic completeness of the sub-ontology, etc. Sub-ontologies are valid independent ontologies, known as materialized ontologies, that are specifically extracted to meet certain needs. Our proposed and implemented framework for the extraction process, referred to as Materialized Ontology View Extractor (MOVE), has addressed this problem by proposing a distributed architecture for the extraction/optimization of a sub-ontology from a large-scale base ontology. We utilize coarse-grained data-level parallelism inherent in the problem domain. Such an architecture serves two purposes: (a) facilitates the utilization of a cluster environment typical in business organizations, which is in line with our envisaged application of the proposed system, and (b) enhances the performance of the computationally extensive extraction process when dealing with ma

关键词： parallel and distributed systems coarse-grained parallelism semantic web ontologies subontology extraction

来源：评论

学校读者我要写书评

暂无评论

OPERATING systems RESEARCH FOR RECONFIGURABLE COMPUTING

引用

IEEE MICRO 2014年第1期34卷 55-59页

作者： Andrews, David Univ Arkansas Dept Comp Sci & Comp Engn Mullins Endowed Chair Comp Engn Fayetteville AR 72701 USA

THIS ARTICLE OVERVIEWS HOW THE RAPID CHANGES TO FIELD-PROGRAMMABLE GATE ARRAY (FPGA) DEVICES HAVE REFOCUSED OPERATING systems RESEARCH WITHIN RECONFIGURABLE COMPUTING. WHERE THE GOAL WAS ONCE TO SIMPLY USE EXISTING OPERATING systems, FPGA-BASED OS RESEARCH MAY NOW BE IN THE NEW POSITION OF HELPING DEFINE THE LOOK AND FEEL OF NEXT-GENERATION OPERATING systems FOR EVOLVING CHIP-HETEROGENEOUS MULTIPROCESSOR systems.

关键词： computer architecture Field programmable gate arrays FPGA heterogeneous multiprocessors multiprocessor systems on chip operating systems parallel and distributed systems Program processors programming models Real-time systems Reconfigurable architectures reconfigurable computing

来源：评论

学校读者我要写书评

暂无评论

An efficient Swarm-Intelligence approach for task scheduling in cloud-based internet of things applications

引用

JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING 2019年第9期10卷 3469-3479页

作者： Boveiri, Hamid Reza Khayami, Raouf Elhoseny, Mohamed Gunasekaran, M. Shiraz Univ Technol Comp Engn & IT Dept Shiraz Iran Mansoura Univ Fac Comp & Informat Mansoura Egypt VIT Univ Vellore Tamil Nadu India

In our rapidly-growing big-data area, often the big sensory data from Internet of Things (IoT) cannot be sent directly to the far data-center in an efficient way because of the limitation in the network infrastructure. Fog computing, which has increasingly gained popularity for real-time applications, offers the utilization of local mini data-centers near the sensors to release the burden from the main data-center, and to exploit the full potential of cloud-based IoT. In this paper, a high-performance approach based on the Max-Min Ant System (MMAS), which is an efficient variation in the family of ant colony optimization algorithms, is proposed to tackle the static task-graph scheduling in homogeneous multiprocessor environments, the predominant technology used as mini-servers in fog computing. The main duty of the proposed approach is to properly manipulate the priority values of tasks so that the most optimal task-order can be achieved. Leveraging background knowledge of the problem, as heuristic values, has made the proposed approach very robust and efficient. Different random task-graphs with different shape parameters have been utilized to evaluate the proposed approach, and the results show its efficiency and superiority versus traditional counterparts from the performance perspective.

关键词： Cloud-based internet of things (IoT) Fog computing Max-min ant system (MMAS) Metaheuristics Multiprocessor task-graph scheduling parallel and distributed systems

来源：评论

学校读者我要写书评

暂无评论

A novel data placement strategy to reduce data traffic during run-time

引用

TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES 2021年第1期29卷 387-402页

作者： Sridhar, Sridevi Vaidyanathan, Rhymend Uthariaraj Anna Univ Ramanujan Comp Ctr Informat & Commun Chennai Tamil Nadu India

High impact scientific applications processed in distributed data centers often involve big data. To avoid the intolerable delays due to huge data movements across data centers during processing, the concept of moving tasks to data was introduced in the last decade. Even after the realization of this concept termed as data locality, the expected quality of service was not achieved. Later, data colocality was introduced where data groupings were identified and then data chunks were placed wisely. However, the aspect of the expected data traffic during run time is generally not considered while placing data. To identify the expected data traffic, the knowledge of the history of data movements is useful. In this work, this knowledge is utilized and an approach to intelligently select the nodes for placing data groups to ensure the least possible data movements is proposed. Systematic scrutiny of log files is conducted and a gain matrix is generated based on maximum likelihood estimation of data movements. Formally, the gain matrix is inversely proportional to the expected data traffic inside the data center. It reflects the performance gain obtained by assigning a block to a node with the lowest possible future data movements. To identify the optimal placement, a many-to-one assignment problem-based algorithm is presented. By experimental analysis, it is observed that the movement of data is significantly reduced by the proposed approach. It is also found that the performance has improved considerably.

关键词： Data management data organization cloud computing parallel and distributed systems

来源：评论

学校读者我要写书评

暂无评论

Link fault tolerability of 3-ary n-cube based on g-good-neighbor r-component edge-connectivity

引用

JOURNAL OF SUPERCOMPUTING 2024年第16期80卷 24738-24757页

作者： Zhang, Qifan Zhou, Shuming Yang, Lulu Fujian Normal Univ Sch Math & Stat Fuzhou 350117 Fujian Peoples R China Fujian Normal Univ Ctr Appl Math Fujian Prov Fuzhou Peoples R China Fujian Normal Univ Key Lab Analyt Math & Applicat Minist Educ Fuzhou Peoples R China

High-performance computing relies heavily on parallel and distributed systems, which promptes us to establish both qualitative and quantitative criteria to assess the fault tolerability and vulnerability of the system's underlying interconnection networks. Consider the scenario in which large-scale link failures split the interconnection network into several components and each processor has multiple good neighboring processors. In this scenario, the fault tolerability of the system can be measured by g-good-neighbor r-component edge-connectivity, denoted by lambda(g,r)(G), which is defined as the minimum number of edges whose removal results in a disconnected network with at least r connected components and each vertex has at least g good neighbors. It combines the strategies of g-good-neighbor edge-connectivity and component edge-connectivity. In this paper, the g-good-neighbor (r+1)-component edge-connectivity of 3-ary n-cube is investigated. This work is the first attempt enhancing link fault tolerability for 3-ary n-cube under double constraints in the presence of the large-scale faulty links, which breaks down the inherent idea that poses one limitation on the resulting network. In addition, our results cover the work of Xu et al. (IEEE Trans Reliab, 71(3):1230-1240, 2022) and Li et al. (J parallel Distrib Comput, 27:104886, 2024). Finally, the compared results reveal that the g-good-neighbor (r+1)-component edge-connectivity is almost r times the size of g-good-neighbor edge-connectivity and much larger than (r+1)-component edge-connectivity in 3-ary n-cube.

关键词： parallel and distributed systems Link fault tolerability g-good-neighbor r-component edge-connectivity 3-ary n-cube

来源：评论

学校读者我要写书评

暂无评论

Resource management in legion

引用

FUTURE GENERATION COMPUTER systems-THE INTERNATIONAL JOURNAL OF ESCIENCE 1999年第5-6期15卷 583-594页

作者： Chapin, SJ Katramatos, D Karpovich, J Grimshaw, A Univ Virginia Sch Engn & Appl Sci Dept Comp Sci Charlottesville VA 22903 USA

The recent development of gigabit networking technology, combined with the;proliferation of low-cost, high-performance microprocessors, has given rise to metacomputing environments. These environments can combine many thousands of hosts, from hundreds of administrative domains, connected by transnational and world-wide networks. Managing the resources in such a system is a complex task, but is necessary to efficiently and economically execute user programs. In this paper, we describe the resource management portions of the Legion metacomputing system, including the basic model and its implementation. These mechanisms are flexible both in their support for system-level resource management but also in their adaptability for user-level scheduling policies. We show this by implementing a simple scheduling policy and demonstrating how it can be adapted to more complex algorithms. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： parallel and distributed systems task scheduling resource management autonomy

来源：评论

学校读者我要写书评

暂无评论

FPDeep: Scalable Acceleration of CNN Training on Deeply-Pipelined FPGA Clusters

引用

IEEE TRANSACTIONS ON COMPUTERS 2020年第8期69卷 1143-1158页

作者： Wang, Tianqi Geng, Tong Li, Ang Jin, Xi Herbordt, Martin Univ Sci & Technol China Dept Phys Hefei 230026 Peoples R China Boston Univ Dept Elect & Comp Engn Boston MA 02215 USA Pacific Northwest Natl Lab PCSD Richland WA 99354 USA

Deep convolutional Neural Networks (CNNs) have revolutionized numerous applications, but the demand for ever more performance remains unabated. Scaling CNN computations to larger clusters is generally done by distributing tasks in batch mode using methods such as distributed synchronous SGD. Among the issues with this approach is that, to make the distributed cluster work with high utilization, the workload distributed to each node must be large;this implies nontrivial growth in the SGD mini-batch size. In this article we propose a framework, called FPDeep, which uses a hybrid of model and layer parallelism to configure distributed reconfigurable clusters to train CNNs. This approach has numerous benefits. First, the design does not suffer from performance loss due to batch size growth. Second, work and storage are balanced among nodes through novel workload and weight partitioning schemes. Part of the mechanism is the surprising finding that it is preferable to store excess weights in neighboring devices rather than in local off-chip memory. Third, the entire system is a fine-grained pipeline. This leads to high parallelism and utilization and also minimizes the time that features need to be cached while waiting for back-propagation. As a result, storage demand is reduced to the point where only on-chip memory is used for the convolution layers. And fourth, we find that the simplest topology, a 1D array, is preferred for interconnecting the FPGAs thus enabling widespread applicability. We evaluate FPDeep with the Alexnet, VGG-16, and VGG-19 benchmarks. Results show that FPDeep has good scalability to a large number of FPGAs, with the limiting factor being the FPGA-to-FPGA bandwidth. But with 250 Gb/s bidirectional bandwidth per FPGA, which is easily supported by current generation FPGAs, FPDeep performance shows linearity up to 100 FPGAs. Energy efficiency is evaluated with respect to GOPs/J. FPDeep provides, on average, 6.4x higher energy efficiency than comparabl

关键词： Training Field programmable gate arrays parallel processing Engines Pipelines Convolution Bandwidth Convolution neural network training reconfigurable computing parallel and distributed systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：