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

Efficient Querying distributed Big-XML Data using MapReduce

INTERNATIONAL JOURNAL OF GRID AND HIGH PERFORMANCE COMPUTING 2016年第3期8卷 70-79页

作者： Song Kunfang Hongwei Lu Huazhong Univ Sci & Technol Wuhan Peoples R China

MapReduce is a widely adopted computing framework for data-intensive applications running on clusters. This paper proposed an approach to exploit data parallelisms in XML processing using MapReduce in Hadoop. The authors' solution seamlessly integrates data storage, labeling, indexing, and parallel queries to process a massive amount of XML data. Specifically, the authors introduce an SDN labeling algorithm and a distributed hierarchical index using DHTs. More importantly, an advanced two-phase MapReduce solution are designed that is able to efficiently address the issues of labeling, indexing, and query processing on big XML data. The experimental results show the efficiency and effectiveness of the proposed parallel XML data approach using Hadoop.

关键词： B-SLCA Big XML distributed programming MapReduce Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Statically Verified Refinements for Multiparty Protocols

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2020年第OOPSLA期4卷 1–30页

作者： Zhou, Fangyi Ferreira, Francisco Hu, Raymond Neykova, Rumyana Yoshida, Nobuko Imperial Coll London London England Univ Hertfordshire Hatfield Herts England Brunel Univ London London England

With distributed computing becoming ubiquitous in the modern era, safe distributed programming is an open challenge. To address this, multiparty session types (MPST) provide a typing discipline for message-passing concurrency, guaranteeing communication safety properties such as deadlock freedom. While originally MPST focus on the communication aspects, and employ a simple typing system for communication payloads, communication protocols in the real world usually contain constraints on the payload. We introduce refined multiparty session types (RMPST), an extension of MPST, that express data dependent protocols via refinement types on the data types. We provide an implementation of RMPST, in a toolchain called SESSION * , using SCRIBBLE, a toolchain for multiparty protocols, and targeting F*, a verification-oriented functional programming language. Users can describe a protocol in SCRIBBLE and implement the endpoints in F* using refinement-typed APIs generated from the protocol. The F* compiler can then statically verify the refinements. Moreover, we use a novel approach of callback-styled API generation, providing static linearity guarantees with the inversion of control. We evaluate our approach with real world examples and show that it has little overhead compared to a naive implementation, while guaranteeing safety properties from the underlying theory.

关键词： Multiparty Session Types (MPST) Refinement Types Code Generation F* distributed programming

来源：评论

学校读者我要写书评

暂无评论

UTILITY SERVERS IN CHARLOTTE

引用

SOFTWARE-PRACTICE & EXPERIENCE 1991年第5期21卷 429-441页

作者： YANG, CQ FINKEL, R UNIV KENTUCKY DEPT COMP SCILEXINGTONKY 40506

Most distributed operating systems are built with a kernel replicated in each machine that supports only basic interprocess communication (IPC) and process control. All other system services, such as memory management, file system, and name service, are distributed in a set of utility servers, which are ordinary processes (except perhaps for some privileges) residing at various machines. Design and implementation of such utility servers in distributed environments are far different from those in a centralized system. This paper presents our experience in building utility servers in Charlotte, a message-based distributed operating system running on a loosely-coupled multicomputer. Utility services in Charlotte are provided by server squads. Each member in a squad covers services to its own community. The squad as a whole co-operatively provides services to the entire system. These servers are designed with the goals of simplicity, efficiency and robustness. The are intended to support a multiprogramming system for the development of distributed algorithms and other distributed applications. We address several major issues in developing a utility server, including the server structure, the management of message buffers, deadlock, and the robustness of server processes. Several utility servers in the Charlotte system are discussed as real examples.

关键词： distributed SYSTEMS OPERATING SYSTEMS SYSTEM SERVICES UTILITY SERVERS distributed programming

来源：评论

学校读者我要写书评

暂无评论

A programming Language Approach to Internet-Based Virtual Computing Environment

引用

Journal of Computer Science & Technology 2011年第4期26卷 600-615页

作者：王戟沈锐王怀民 National Laboratory for Parallel and Distributed Processing School of ComputerNational University of Defense Technology

There is an increasing need to build scalable distributed systems over the Internet infrastructure. However the development of distributed scalable applications suffers from lack of a wide accepted virtual computing environment. Users have to take great efforts on the management and sharing of the involved resources over Internet, whose characteristics are intrinsic growth, autonomy and diversity. To deal with this challenge, Internet-based Virtual Computing Environment （iVCE） is proposed and developed to serve as a platform for distributed scalable applications over the open infrastructure, whose kernel mechanisms are on-demand aggregation and autonomic collaboration of resources. In this paper, we present a programming language for iVCE named Owlet. Owlet conforms with the conceptual model of iVCE, and exposes the iVCE to application developers. As an interaction language based on peer-to-peer content-based publish/subscribe scheme, Owlet abstracts the Internet as an environment for the roles to interact, and uses roles to build a relatively stable view of resources for the on-demand resource aggregation. It provides language constructs to use 1） distributed event driven rules to describe interaction protocols among different roles, 2） conversations to correlate events and rules into a common context, and 3） resource pooling to do fault tolerance and load balancing among networked nodes. We have implemented an Owlet compiler and its runtime environment according to the architecture of iVCE, and built several Owlet applications, including a peer-to-peer file sharing application. Experimental results show that, with iVCE, the separation of resource aggregation logic and business logic significantly eases the process of building scalable distributed applications.

关键词： distributed architecture distributed programming on demand aggregation virtual computing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

artdaq: An Event-Building, Filtering, and Processing Framework

引用

IEEE TRANSACTIONS ON NUCLEAR SCIENCE 2013年第5期60卷 3764-3771页

作者： Biery, K. Green, C. Kowalkowski, J. Paterno, M. Rechenmacher, R. Fermilab Natl Accelerator Lab Div Comp Sci Batavia IL 60510 USA

Several current and proposed experiments at the Fermi National Accelerator Laboratory, Batavia, IL, USA, have novel data acquisition needs. These include 1) continuous digitization, using commercial high-speed digitizers, of signals from the detectors, 2) the transfer of all of the digitized waveform data to commercial off-the-shelf (COTS) processors, 3) the filtering or compression of the waveform data, or both, and 4) the writing of the resultant data to disk for later, more complete, analysis. To address these needs, members of the Accelerator and Detector Simulation and Support Department within the Scientific Computing Division at Fermilab are using parallel processing technologies in the development of artdaq, a generic data acquisition toolkit. The artdaq toolkit uses Message Passing Interface (MPI) and art, an established event-processing framework shared by new experiments at Fermilab. In an artdaq program, the digitized data are transferred into computing nodes using commodity Peripheral Component Interconnect Express (PCIe) cards, and event fragments are transferred between distributed processes using MPI and assembled into complete events. These events are then processed by a configurable selection of user-specified algorithms, commonly including filtering and compression algorithms, using the art event-processing framework. This paper describes the architecture and implementation of the first phase of the artdaq toolkit and shows early performance results with configurations that match upcoming experiments both at Fermilab and elsewhere.

关键词： Concurrent programming data acquisition distributed programming

来源：评论

学校读者我要写书评

暂无评论

Asynchronous messaging between Web services using SSDL

引用

IEEE INTERNET COMPUTING 2006年第1期10卷 26-39页

作者： Parastatidis, S Woodman, S Webber, J Kuo, D Greenfield, P Newcastle Univ Sch Comp Sci Newcastle Upon Tyne NE1 7RU Tyne & Wear England

The SOAP Service Description Language (SSDL) is designed for describing asynchronous, message-oriented, and multimessage interactions between Web services. SSDL provides the basis for a range of protocol description frameworks. At one end of the spectrum, such frameworks can be simple, SOAP-centric replacements for the Web Services Description Language. At the other end, they're a more expressive contract-definition language enabling formal verification of asynchronous application protocol properties. This is possible because SSDL focuses on the "message" abstraction as the building block for service-oriented applications.

关键词： SOAP SSDL System Architectures Integration And Modelling Architecture Standards distributed Systems distributed programming Validation Asynchronous Synchronous Operation Internet Applications

来源：评论

学校读者我要写书评

暂无评论

distributed System Development with SCALALOCI

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2018年第OOPSLA期2卷 1–30页

作者： Weisenburger, Pascal Koehler, Mirko Salvaneschi, Guido Tech Univ Darmstadt Hsch Str 10 D-64289 Darmstadt Hessen Germany

distributed applications are traditionally developed as separate modules, often in different languages, which react to events, like user input, and in turn produce new events for the other modules. Separation into components requires time-consuming integration. Manual implementation of communication forces programmers to deal with low-level details. The combination of the two results in obscure distributed data flows scattered among multiple modules, hindering reasoning about the system as a whole. The SCALALOCI distributed programming language addresses these issues with a coherent model based on placement types that enables reasoning about distributed data flows, supporting multiple software architectures via dedicated language features and abstracting over low-level communication details and data conversions. As we show, SCALALOCI simplifies developing distributed systems, reduces error-prone communication code and favors early detection of bugs.

关键词： distributed programming Multitier programming Reactive programming Placement Types Scala

来源：评论

学校读者我要写书评

暂无评论

Type-Safe Dynamic Placement with First-Class Placed Values

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2023年第OOPSLA期7卷 2142–2170页

作者： Zakhour, George Weisenburger, Pascal Salvaneschi, Guido Univ St Gallen Torstr 25 CH-9000 St Gallen Switzerland

Several distributed programming language solutions have been proposed to reason about the placement of data, computations, and peers interaction. Such solutions include, among the others, multitier programming, choreographic programming and various approaches based on behavioral types. These methods statically ensure safety properties thanks to a complete knowledge about placement of data and computation at compile time. In distributed systems, however, dynamic placement of computation and data is crucial to enable performance optimizations, e.g., driven by data locality or in presence of a number of other constraints such as security and compliance regarding data storage location. Unfortunately, in existing programming languages, dynamic placement conflicts with static reasoning about distributed programs: the flexibility required by dynamic placement hinders statically tracking the location of data and computation. In this paper we present Dyno, a programming language that enables static reasoning about dynamic placement. Dyno features a type system where values are explicitly placed, but in contrast to existing approaches, placed values are also first class, ensuring that they can be passed around and referred to from other locations. Building on top of this mechanism, we provide a novel interpretation of dynamic placement as unions of placement types. We formalize type soundness, placement correctness (as part of type soundness) and architecture conformance. In case studies and benchmarks, our evaluation shows that Dyno enables static reasoning about programs even in presence of dynamic placement, ensuring type safety and placement correctness of programs at negligible performance cost. We reimplement an Android app with similar to 7 K LOC in Dyno, find a bug in the existing implementation, and show that the app's approach is representative of a common way to implement dynamic placement found in over 100 apps in a large open-source app store.

关键词： distributed programming Multitier programming Placement Types Scala Dynamic Placement Union Types

来源：评论

学校读者我要写书评

暂无评论

Extending Shared-Memory Computations to Multiple distributed Nodes

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2020年第8期11卷 675-685页

作者： Ahmed, Waseem King Abdulaziz Univ Dept Comp Sci Fac Comp & Informat Technol Jeddah Saudi Arabia

With the emergence of accelerators like GPUs, MICs and FPGAs, the availability of domain specific libraries (like MKL) and the ease of parallelization associated with CUDA and OpenMP based shared-memory programming, node-based parallelization has recently become a popular choice among developers in the field of scientific computing. This is evident from the large volume of recently published work in various domains of scientific computing, where shared-memory programming and accelerators have been used to accelerate applications. Although these approaches are suitable for small problem-sizes, there are issues that need to be addressed for them to be applicable to larger input domains. Firstly, the primary focus of these works has been to accelerate the core kernel;acceleration of input/output operations is seldom considered. Many operations in scientific computing operate on large matrices-both sparse and dense - that are read from and written to external files. These input-output operations present themselves as bottlenecks and significantly effect the overall application time. Secondly, node-based parallelization limits a developer from distributing the computation beyond a single node without him having to learn an additional programming paradigm like MPI. Thirdly, the problem size that can be effectively handled by a node is limited by the memory of the node and accelerator. In this paper, an Asynchronous Multi-node Execution (AMNE) approach is presented that uses a unique combination of the shared-file system and pseudo-replication to extend node-based algorithms to a distributed multiple node implementation with minimal changes to the original node-based code. We demonstrate this approach by applying it to GEMM, a popular kernel in dense linear algebra and show that the presented methodology significantly advances the state of art in the field of parallelization and scientific computing.

关键词： GPU OpenMP shared memory programming distributed programming CUDA

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：