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

Integrating relational databases with support for updates

Proceedings international symposium on databases in parallel and distributed systems

作者： Gamal-Eldin, M.Samy Thomas, Gomer Elmasri, Ramez Clarkson Univ Potsdam NY USA

ISBN: (纸本)0818608935

Most work on database integration has considered only support for data retrieval, not support for updates, and often the use for a special semantically rich data model has been required. The authors present an approach to database integration which supports updates and which uses only the standard relational data model. Many of the ideas used in this approach are applicable to database integration in the context of other data models as well.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Decentralized Runtime Verification of LTL Specifications in distributed systems 29

Decentralized Runtime Verification of LTL Specifications in ...

引用

29th IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Mostafa, Menna Bonakdarpour, Borzoo Univ Waterloo Sch Comp Sci Waterloo ON N2L 3G1 Canada McMaster Univ Dept Comp & Software Hamilton ON L8S 4L8 Canada

ISBN: (纸本)9781479986484

Runtime verification is a lightweight automated formal method for specification-based runtime monitoring as well as testing of large real-world systems. While numerous techniques exist for runtime verification of sequential programs, there has been very little work on specification-based monitoring of distributed systems. In this paper, we propose the first sound and complete method for runtime verification of asynchronous distributed programs for the 3-valued semantics of LTL specifications defined over the global state of the program. Our technique for evaluating LTL properties is inspired by distributed computation slicing, an approach for abstracting distributed computations with respect to a given predicate. Our monitoring technique is fully decentralized in that each process in the distributed program under inspection maintains a replica of the monitor automaton. Each monitor may maintain a set of possible verification verdicts based upon existence of concurrent events. Our experiments on runtime monitoring of a simulated swarm of flying drones show that due to the design of our Algorithm, monitoring overhead grows only in the linear order of the number of processes and events that need to be monitored.

关键词： Runtime monitoring Asynchronous distributed systems Formal methods

来源：评论

学校读者我要写书评

暂无评论

A Fast Repair Code Based on Regular Graphs for distributed Storage systems

A Fast Repair Code Based on Regular Graphs for Distributed S...

引用

26th IEEE international parallel and distributed Processing symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Wang, Yan Wang, Xin Fudan Univ Sch Comp Sci Shanghai Key Lab Intelligent Informat Proc Shanghai 200433 Peoples R China

ISBN: (纸本)9780769546766

distributed storage systems (DSS) play an important role in data storage applications, since they provide high reliability for huge data storage requirement. As node failures are frequent in a large distributed storage system, the performance of repairing node failure causes many researchers' interests. In this paper, we propose a distributed storage code to minimize the coding complexity during the repairing process, at a cost of inducing larger redundancy. Our code construction is based on regular graphs and exploits simple look-up repair. We analyze the performance of the proposed code, and compare them with existing distributed storage codes. Analytical results show that the proposed code outperforms the others in terms of low repair complexity and disk I/O overhead.

关键词： distributed storage systems Erasure codes Regenerating codes

来源：评论

学校读者我要写书评

暂无评论

Vector prefix and reduction computation on coarse-grained, distributed-memory parallel machines 1

Vector prefix and reduction computation on coarse-grained, d...

引用

1st Merged international parallel Processing symposium/symposium on parallel and distributed Processing (IPPS/SPDP 1998)

作者： Bae, S Kim, D Ranka, S ETRI Parallel Programming Sect Taejon South Korea

ISBN: (纸本)0818684038

Vector prefix and reduction are collective communication primitives in which all processors must cooperate. We present two parallel algorithms, the direct algorithm and the split algorithm, for vector prefix and reduction computation on coarse-grained, distributed-memory parallel machines. Our algorithms are relatively architecture independent and can be used effectively in many applications such as Pack/Unpack, Array Prefix/Reduction Functions, and Array Combining Scatter Functions, which are defined in Fortran 90 and in High Performance Fortran. Experimental results on the CM-5 are presented.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Schedule Dynamic Multiple parallel Jobs with Precedence-constrained Tasks on Heterogeneous distributed Computing systems 14

Schedule Dynamic Multiple Parallel Jobs with Precedence-cons...

引用

IEEE 14th international symposium on parallel and distributed Computing (ISPDC)

作者： Liu, Liangjiao Xie, Guoqi Yang, Liu Li, Renfa Hunan Univ Coll Comp Sci & Elect Engn Changsha 410082 Hunan Peoples R China Hunan Univ Key Lab Embedded & Network Comp Hunan Prov Changsha 410082 Hunan Peoples R China Dev & Reform Commiss Hunan Prov Changsha 410000 Hunan Peoples R China

ISBN: (纸本)9781467371483

Computer systems tend to be heterogeneous parallel and distributed computing systems, which are characterized by having various types of computational units interconnected via networks for executing multiple parallel jobs precedence-constrained tasks. Scheduling multiple jobs, which arrive at different instants, on such systems for fastest execution is a well-known NP-hard optimization problem. In order to achieve high-performance of systems, two important factors can be improved. One factor is the heterogeneity. Most algorithms use the upward rank value for ordering tasks and the earliest finish time for assigning processors. These two criteria can be improved to permit creating accurate and efficient schedules in heterogeneous distributed computing systems. Another factor is the fairness, existing algorithms are for static scheduling, and failed to make full use of the fairness in dynamic environments, such that obvious unfairness to longer-makespan jobs or shorter-makespan jobs can be caused. A dynamic multiple parallel jobs scheduling algorithm called F DMHSV (Fairness of Dynamic Multiple Heterogeneous Selection Value) is proposed to address the above problems to achieve high-performance of systems in this paper. Both example and extensive experimental evaluation demonstrate significant improvement of the F_DMHSV algorithm.

关键词： dynamic fairness heterogeneity multiple parallel jobs precedence-constrained tasks

来源：评论

学校读者我要写书评

暂无评论

An Efficient Scheduling Algorithm for Energy Consumption Constrained parallel Applications on Heterogeneous distributed systems 15

An Efficient Scheduling Algorithm for Energy Consumption Con...

引用

15th IEEE international symposium on parallel and distributed Processing with Applications (ISPA) / 16th IEEE international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Song, Jinlin Xie, Guoqi Li, Renfa Chen, Xiaoming Hunan Univ Coll Comp Sci & Elect Engn Changsha Hunan Peoples R China Key Lab Embedded & Network Comp Hunan Prov Changsha Hunan Peoples R China

ISBN: (纸本)9781538637906

As the explosive growth of energy consumption in current heterogeneous distributed systems, energy consumption constraint has been one of the primary design issues Minimizing the schedule length while satisfying the energy consumption constraint of parallel applications is one of the most important problem which has been studied recently. Previous studies have proposed a preassignment approach which tried to presuppose the minimum energy consumption assignment for unassigned tasks to solve the problem based on the dynamic voltage and frequency scaling (DVFS) technique. However, the preassignment of unassigned tasks with the minimum energy consumption does not necessarily lead to the minimization of the schedule length. In this study, we propose an efficient scheduling algorithm using a relative average assignments for tasks. The results of experiments on two real parallel applications validate that the proposed algorithm can obtain shorter schedule length while satisfying the energy consumption constraint compared with the state-ofthe-art methods in various situations.

关键词： dynamic voltage and frequency scaling (DVFS) energy consumption constraint heterogeneous distributed systems parallel application schedule length

来源：评论

学校读者我要写书评

暂无评论

Opass: Analysis and Optimization of parallel Data Access on distributed File systems 29

Opass: Analysis and Optimization of Parallel Data Access on ...

引用

29th IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Yin, Jiangling Wang, Jun Zhou, Jian Lukasiewicz, Tyler Huang, Dan Zhang, Junyao Univ Cent Florida Dept Elect Engn & Comp Sci Orlando FL 32816 USA

ISBN: (纸本)9781479986484

In this paper, we study parallel data access on distributed file systems, e.g, the Hadoop file system. Our experiments show that parallel data read requests are often served data remotely and in an imbalanced fashion. This results in a serious disk access and data transfer contention on certain cluster/storage nodes. We conduct a complete analysis on how remote and imbalanced read patterns occur and how they are affected by the size of the cluster. We then propose a novel method to Optimize parallel Data Access on distributed File systems referred to as Opass. The goal of Opass is to reduce remote parallel data accesses and achieve a higher balance of data read requests between cluster nodes. To achieve this goal, we represent the data read requests that are issued by parallel applications to cluster nodes as a graph data structure where edges weights encode the demands of data locality and load capacity. Then we propose new matching-based algorithms to match processes to data based on the configurations of the graph data structure so as to compute the maximum degree of data locality and balanced access. Our proposed method can benefit parallel data-intensive analysis with various parallel data access strategies. Experiments are conducted on PRObEs Marmot 128-node cluster testbed and the results from both benchmark and well-known parallel applications show the performance benefits and scalability of Opass.

关键词： parallel Data Access distributed File systems Bipartite Matching

来源：评论

学校读者我要写书评

暂无评论

Performance of Causal Consistency Algorithms for Partially Replicated systems 30

Performance of Causal Consistency Algorithms for Partially R...

引用

30th IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Hsu, Ta Yuan Kshemkalyani, Ajay D. Univ Illinois Dept Elect & Comp Engn Chicago IL 60607 USA Univ Illinois Dept Comp Sci Chicago IL 60607 USA

ISBN: (纸本)9781509036820

Many advances have been made in the design of full replication protocols in distributed systems. Causal consistency in such systems has received great interest. However, most existing works focus on the implementation in full replication because it simplifies designing the algorithm. More recently, interest in full replication has shifted to focus on the development of partial replication protocols which emphasize a better network capacity utilization. In this paper, we present the analytic data to compare the performances of three proposed protocols in partial replication and full replication. We also give simulation results to present the advantage of partial replication over full replication.

关键词： Causal consistency Causality Cloud computing distributed computing Geo-replicated storage Replication

来源：评论

学校读者我要写书评

暂无评论

Mobile processing in open systems

Mobile processing in open systems

引用

5th IEEE international symposium on High Performance distributed Computing

作者： Sapaty, PS UNIV SURREY DEPT ELECT & ELECT ENGNGUILDFORD GU2 5XHSURREYENGLAND

ISBN: (纸本)0818675829

A universal spatial automaton, called WAVE, for highly parallel processing in arbitrary distributed systems is described. The automaton is based on a virus principle where recursive programs, or waves, self-navigate in networks of data or processes in multiple cooperative parts while controlling and modifying the environment they exist in and move through. The layered general organisation of the automaton as well as its distributed implementation in computer networks have been discussed. As the automaton dynamically creates, modifies, activates and processes any knowledge networks arbitrarily distributed in computer networks, it can easily model any other paradigms for parallel and distributed computing. Comparison of WAVE with some known programming models and languages, and ideas of their possible integration have also been given.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A Case for Stale Synchronous distributed Model for Declarative Recursive Computation

引用

THEORY AND PRACTICE OF LOGIC PROGRAMMING 2019年第5-6期19卷 1056-1072页

作者： Das, Ariyam Zaniolo, Carlo Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90024 USA

A large class of traditional graph and data mining algorithms can be concisely expressed in Datalog, and other Logic-based languages, once aggregates are allowed in recursion. In fact, for most BigData algorithms, the difficult semantic issues raised by the use of non-monotonic aggregates in recursion are solved by Pre-Mappability (PreM), a property that assures that for a program with aggregates in recursion there is an equivalent aggregate-stratified program. In this paper we show that, by bringing together the formal abstract semantics of stratified programs with the efficient operational one of unstratified programs, PreM can also facilitate and improve their parallel execution. We prove that PreM-optimized lock-free and decomposable parallel semi-naive evaluations produce the same results as the single executor programs. Therefore, PreM can be assimilated into the data-parallel computation plans of different distributed systems, irrespective of whether these follow bulk synchronous parallel (BSP) or asynchronous computing models. In addition, we show that non-linear recursive queries can be evaluated using a hybrid stale synchronous parallel (SSP) model on distributed environments. After providing a formal correctness proof for the recursive query evaluation with PreM under this relaxed synchronization model, we present experimental evidence of its benefits.

关键词： Datalog Deductive databases Recursive Query Stale Synchronous parallel Model Bulk Synchronous parallel Model parallel and distributed Computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：