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

14th IEEE International Conference on Data Mining (IEEE ICDM)

作者： Bifet, Albert De Francisci Morales, Gianmarco HUAWEI Noahs Ark Lab Hong Kong Hong Kong Peoples R China Yahoo Labs Barcelona Spain

ISBN: (纸本)9781479942749

Big data is flowing into every area of our life, professional and personal. Big data is defined as datasets whose size is beyond the ability of typical software tools to capture, store, manage and analyze, due to the time and memory complexity. Velocity is one of the main properties of big data. In this demo, we present SAMOA (Scalable Advanced Massive Online Analysis), an open-source platform for mining big data streams. It provides a collection of distributed streaming algorithms for the most common data mining and machine learning tasks such as classification, clustering, and regression, as well as programming abstractions to develop new algorithms. It features a pluggable architecture that allows it to run on several distributed stream processing engines such as Storm, S4, and Samza. SAMOA is written in Java and is available at http://*** under the Apache Software License version 2.0.

关键词： Big Data data mining learning (artificial intelligence) pattern classification pattern clustering regression analysis Apache Software License version 2.0 Java S4 SAMOA Samza Storm big data stream learning big data stream mining classification task clustering task distributed stream processing engines distributed streaming algorithms machine learning tasks open-source platform pluggable architecture programming abstractions regression task scalable advanced massive online analysis Algorithm design and analysis Big data Data mining Digital signal processing Engines Machine learning algorithms Storms Classification Clustering Data Streams Distributed Systems Machine Learning Regression Toolbox big data storms data mining Samoan Islands Algorithm design and analysis Cluster Analysis Machine learning algorithms Engines tool cases Java Java programming language Distributed Systems Digital signal processing Pattern recognition Regression (Psychology)

来源：评论

学校读者我要写书评

暂无评论

Improving SDN with InSPired Switches

Improving SDN with InSPired Switches

引用

Symposium on Software Defined Networking (SDN) Research (SOSR)

作者： Bifulco, Roberto Boite, Julien Bouet, Mathieu Schneider, Fabian NEC Labs Europe Heidelberg Germany Thales Commun & Secur Gennevilliers France

ISBN: (纸本)9781450334518

In SDN, complex protocol interactions that require forging network packets are handled on the controller side. While this ensures flexibility, both performance and scalability are impacted, introducing serious concerns about the applicability of SDN at scale. To improve on these issues, without infringing the SDN principles of control and data planes separation, we propose an API for programming the generation of packets in SDN switches. Our InSP API allows a programmer to define in-switch packet generation operations, which include the specification of triggering conditions, packet's content and forwarding actions. To validate our design, we implemented the InSP API in an OpenFlow software switch and in a controller, requiring only minor modifications. Finally, we demonstrate that the application of the InSP API, for the implementation of a typical ARP-handling use case, is beneficial for the scalability of both switches and controller.

关键词： Software-defined Networking programming abstractions OpenFlow

来源：评论

学校读者我要写书评

暂无评论

Towards Higher-Level abstractions for Quantum Computing 22

Towards Higher-Level Abstractions for Quantum Computing

引用

Australian Computer Science Week (ACSW)

作者： Cobb, Adrian Schneider, Jean-Guy Lee, Kevin Deakin Univ Geelong Vic Australia

ISBN: (纸本)9781450396066

Quantum Computing (QC) has emerged as a field of ever-increasing activity as it promises to revolutionize computation and enable the solution of computational problems that we (realistically) cannot solve with Classical Computing to date. However, existing quantum programming environments mostly require an in-depth understanding of the basic QC building blocks, that is, quantum states, superposition, entanglement and measurement as well as the changing of quantum states using basic quantum gates. The present state of quantum programming reminds us of how Classical Computing was about 70 years ago when computing machines such as the ENIAC required significant effort to program solely using very basic digital building blocks. Over the decades, though, increasingly higher-level abstractions have been created on top of the basic building blocks of Classical Computing and made computation much more accessible and wide-spread. In order to make Quantum Computing more accessible, we argue that Software Engineering for QC needs to embark on a similar journey and create abstractions that shield developers from the basic QC building blocks as much as possible so that they can focus their attention on solving problems and less on how to manipulate quantum states using quantum circuits. Based on our experience of developing a scalable quantum n-queens solver, this paper aims to formulate recommendations for raising the level of abstraction in Quantum Software Engineering.

关键词： Quantum Computing Quantum Software Engineering programming abstractions

来源：评论

学校读者我要写书评

暂无评论

Optimistic Concurrency Control for Multihop Sensor Networks

Optimistic Concurrency Control for Multihop Sensor Networks

引用

7th IEEE International Wireless Communications and Mobile Computing Conference (IWCMC)

作者： Soysal, Onur Aydin, Bahadir Ismail Demirbas, Murat Google Mountain View CA 94043 USA SUNY Buffalo Dept Comp Sci & Engn Buffalo NY USA

ISBN: (纸本)9781424495375

In this study, we provide a lightweight singlehop primitive, Read-All-Write-Self (RAWS), that achieves optimistic concurrency control. RAWS guarantees serializability, which simplifies implementation and verification of distributed algorithms, compared to the low level message passing model. We also present a self-stabilizing multihop extension of RAWS, called Multihop Optimistic Concurrency Control Algorithm (MOCCA), to address the challenges of multihop networks. We implement RAWS on motes and investigate the effects of message loss over this novel primitive.

关键词： Transactions optimistic concurrency control programming abstractions wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Isolation for Nested Task Parallelism 13

Isolation for Nested Task Parallelism

引用

2013 ACM SIGPLAN International Conference on Object Oriented programming Systems Languages

作者： Zhao, Jisheng Lublinerman, Roberto Budimlic, Zoran Chaudhuri, Swarat Sarkar, Vivek Rice Univ Houston TX 77251 USA Google Inc Mountain View CA USA

ISBN: (纸本)9781450323741

Isolation-the property that a task can access shared data without interference from other tasks-is one of the most basic concerns in parallel programming. While there is a large body of past work on isolated task-parallelism, the integration of isolation, task-parallelism, and nesting of tasks has been a difficult and unresolved challenge. In this paper, we present a programming and execution model called Otello where isolation is extended to arbitrarily nested parallel tasks with irregular accesses to heap data. At the same time, no additional burden is imposed on the programmer, who only exposes parallelism by creating and synchronizing parallel tasks, leaving the job of ensuring isolation to the underlying compiler and runtime system. Otello extends our past work on Aida execution model and the delegated isolation mechanism [22] to the setting of nested parallelism. The basic runtime construct in Aida and Otello is an assembly: a task equipped with a region in the shared heap that it owns. When an assembly A conflicts with an assembly B, A transfers-or delegates-its code and owned region to a carefully selected assembly C in a way that will ensure isolation with B, leaving the responsibility of re-executing task A to C. The choice of C depends on the nesting relationship between A and B. We have implemented Otello on top of the Habanero Java (HJ) parallel programming language [8], and used this implementation to evaluate Otello on collections of nested task-parallel benchmarks and non-nested transactional benchmarks from past work. On the nested task-parallel bench-marks, Otello achieves scalability comparable to HJ programs without built-in isolation, and the relative overhead of Otello is lower than that of many published data-race detection algorithms that detect the isolation violations (but do not enforce isolation). For the transactional benchmarks, Otello incurs lower overhead than a state-of-the-art software transactional memory system (Deuce STM).

关键词： Languages Design Isolation programming abstractions Irregular parallelism Contention

来源：评论

学校读者我要写书评

暂无评论

Delegated Isolation 11

Delegated Isolation

引用

2011 ACM International Conference on Object Oriented programming Systems Languages and Applications

作者： Lublinerman, Roberto Zhao, Jisheng Budimlic, Zoran Chaudhuri, Swarat Sarkar, Vivek Penn State Univ University Pk PA 16802 USA Rice Univ Houston TX 77251 USA

ISBN: (纸本)9781450309400

Isolation-the property that a task can access shared data without interference from other tasks-is one of the most basic concerns in parallel programming. In this paper, we present Aida, a new model of isolated execution for parallel programs that perform frequent, irregular accesses to pointer-based shared data structures. The three primary benefits of Aida are dynamism, safety and liveness guarantees, and programmability. First, Aida allows tasks to dynamically select and modify, in an isolated manner, arbitrary fine-grained regions in shared data structures, all the while maintaining a high level of concurrency. Consequently, the model can achieve scalable parallelization of regular as well as irregular shared-memory applications. Second, the model offers freedom from data races, deadlocks, and livelocks. Third, no extra burden is imposed on programmers, who access the model via a simple, declarative isolation construct that is similar to that for transactional memory. The key new insight in Aida is a notion of delegation among concurrent isolated tasks (known in Aida as assemblies). Each assembly A is equipped with a region in the shared heap that it owns-the only objects accessed by A are those it owns, guaranteeing race-freedom. The region owned by A can grow or shrink flexibly-however, when A needs to own a datum owned by B, A delegates itself, as well as its owned region, to B. From now on, B has the responsibility of re-executing the task A set out to complete. Delegation as above is the only inter-assembly communication primitive in Aida. In addition to reducing contention in a local, data-driven manner, it guarantees freedom from deadlocks and livelocks. We offer an implementation of Aida on top of the Habanero Java parallel programming language. The implementation employs several novel ideas, including the use of a union-find data structure to represent tasks and the regions that they own. A thorough evaluation using several irregular data-parallel bench

关键词： Languages Design Isolation programming abstractions Irregular parallelism Contention

来源：评论

学校读者我要写书评

暂无评论

MPR: An MPI Framework for Distributed Self-adaptive Stream Processing 30th

MPR: An MPI Framework for Distributed Self-adaptive Stream P...

引用

30th European Conference on Parallel and Distributed Processing (Euro-Par)

作者： Loff, Junior Griebler, Dalvan Fernandes, Luiz Gustavo Binder, Walter Univ Svizzera Italiana USI Fac Informat Lugano Switzerland Pontif Catholic Univ Rio Grande do Sul PUCRS Sch Technol Porto Alegre RS Brazil

ISBN: (纸本)9783031695827;9783031695834

Stream processing systems must often cope with workloads varying in content, format, size, and input rate. The high variability and unpredictability make statically fine-tuning them very challenging. Our work addresses this limitation by providing a new framework and run-time system to simplify implementing and assessing new self-adaptive algorithms and optimizations. We implement a prototype on top of MPI called MPR and show its functionality. We focus on horizontal scaling by supporting the addition and removal of processes during execution time. Experiments reveal that MPR can achieve performance similar to that of a handwritten static MPI application. We also assess MPR's adaptation capabilities, showing that it can readily re-configure itself, with the help of a self-adaptive algorithm, in response to workload variations.

关键词： Stream Processing Distributed Systems Self-adaptive Parallel programming programming abstractions MPI

来源：评论

学校读者我要写书评

暂无评论

Concurrent Assemblies: A Model for Concurrent Program Execution

Concurrent Assemblies: A Model for Concurrent Program Execut...

引用

作者： Lublinerman, Roberto Elias PennState University Libraries

学位级别：Doctor of Philosophy

We present Concurrent Assemblies, an abstract model for modeling shared memory parallel programs. In particular Concurrent Assemblies is targeted to irregular parallel applications such as those manipulating mutable pointer-based data structures. Typically in these applications, there is no a priori bound on the available *** Concurrent Assemblies abstract execution model addresses dynamism and locality through the unifying abstraction of a concurrent assembly: a local region in a shared data structure equipped with a short-lived, speculative thread of control. The thread of control in an assembly can only access objects within the assembly. While objects can migrate from assembly to assembly, such migration is local---i.e., objects only move from one assembly to a neighboring one---and does not lead to aliasing. programming primitives include a merge operation, by which an assembly merges with an adjacent assembly, and a split operation, which splits an assembly into smaller ones. Our abstractions are race-free and inherently *** addition to the formal definition of the Concurrent Assemblies abstract model, we show the usefulness of such an abstract model by presenting two different programming languages that can be modeled as instances of the Concurrent Assemblies abstract model. The first one is JChorus, a high-level parallel programming language built on top of the sequential subset of Java, suitable for irregular, heap-manipulating applications like mesh refinement and epidemic simulations. One goal of JChorus is to express the dynamic and instance-dependent patterns of memory access that are common in typical irregular applications. Its other focus is locality of effects: the property that in many of the same applications, typical imperative commands only affect small, local regions in the shared *** second is Habanero-Chorus, a parallel subset of the Habanero-Java programming language. Here concurrency is expressed as asynchronous

关键词： Parallel programming programming abstractions Irregular parallelism Data-parallelism Ownership

来源：评论

学校读者我要写书评

暂无评论

Demo abstract: programming wireless sensor networks with logical neighborhoods: A road tunnel use case

Demo abstract: Programming wireless sensor networks with log...

引用

5th ACM International Conference on Embedded Networked Sensor Systems, SenSys'07

作者： Mottola, Luca Picco, Gian Pietro Politecnico di Milano Italy University of Trento Italy

来源：评论

学校读者我要写书评

暂无评论

programming Wireless Sensor Networks: Fundamental Concepts and State of the Art

引用

ACM COMPUTING SURVEYS 2011年第3期43卷 19-19页

作者： Mottola, Luca Picco, Gian Pietro Univ Trento Trento Italy

Wireless sensor networks (WSNs) are attracting great interest in a number of application domains concerned with monitoring and control of physical phenomena, as they enable dense and untethered deployments at low cost and with unprecedented flexibility. However, application development is still one of the main hurdles to a wide adoption of WSN technology. In current real-world WSN deployments, programming is typically carried out very close to the operating system, therefore requiring the programmer to focus on low-level system issues. This not only distracts the programmer from the application logic, but also requires a technical background rarely found among application domain experts. The need for appropriate high-level programming abstractions, capable of simplifying the programming chore without sacrificing efficiency, has long been recognized, and several solutions have hitherto been proposed, which differ along many dimensions. In this article, we survey the state of the art in programming approaches for WSNs. We begin by presenting a taxonomy of WSN applications, to identify the fundamental requirements programming platforms must deal with. Then, we introduce a taxonomy of WSN programming approaches that captures the fundamental differences among existing solutions, and constitutes the core contribution of this article. Our presentation style relies on concrete examples and code snippets taken from programming platforms representative of the taxonomy dimensions being discussed. We use the taxonomy to provide an exhaustive classification of existing approaches. Moreover, we also map existing approaches back to the application requirements, therefore providing not only a complete view of the state of the art, but also useful insights for selecting the programming abstraction most appropriate to the application at hand.

关键词： Languages Design Experimentation Measurement Performance Wireless sensor networks networked embedded systems programming abstractions middleware

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：