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

programming abstractions for Software-Defined Wireless Networks

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2015年第2期12卷 146-162页

作者： Riggio, Roberto Marina, Mahesh K. Schulz-Zander, Julius Kuklinski, Slawomir Rasheed, Tinku CREATE NET I-38123 Trento Italy Univ Edinburgh Sch Informat Edinburgh EH8 9Y Midlothian Scotland Tech Univ Berlin TU Berlin D-10623 Berlin Germany Orange Polska PL-96100 Warsaw Poland

Software-Defined Networking (SDN) has received, in the last years, significant interest from the academic and the industrial communities alike. The decoupled control and data planes found in an SDN allows for logically centralized intelligence in the control plane and generalized network hardware in the data plane. Although the current SDN ecosystem provides a rich support for wired packet-switched networks, the same cannot be said for wireless networks where specific radio data-plane abstractions, controllers, and programming primitives are still yet to be established. In this work, we present a set of programming abstractions modeling the fundamental aspects of a wireless network, namely state management, resource provisioning, network monitoring, and network reconfiguration. The proposed abstractions hide away the implementation details of the underlying wireless technology providing programmers with expressive tools to control the state of the network. We also present a Software-Defined Radio Access Network Controller for Enterprise WLANs and a Python-based Software Development Kit implementing the proposed abstractions. Finally, we experimentally evaluate the usefulness, efficiency and flexibility of the platform over a real 802.11-based WLAN.

关键词： Network management programming abstractions software-defined wireless networks WLANs

来源：评论

学校读者我要写书评

暂无评论

programming abstractions for content-based publish/subscribe in object-oriented languages

引用

On the Move Confederated International Workshop and Conference

作者： Ulbrich, A Mühl, G Weis, T Geihs, K Tech Univ Berlin IVS Intelligent Networks & Distributed Syst D-10587 Berlin Germany

ISBN: (纸本)3540236627

Asynchronous event-based communication facilitates loose coupling and eases the integration of autonomous, heterogeneous components into complex systems. Many middleware platforms for event-based communication follow the publish/subscribe paradigm. Despite the usefulness of such systems, their programming support is currently limited. Usually, publish/subscribe systems only exhibit low-level programming abstractions to application developers. In this paper we investigate programming abstractions for content-based publish/subscribe middleware in object-oriented languages, how they can be integrated in applications, and their implications on middleware implementation. We focus on the definition of filters and their implementation, the handling of notifications and meta-data, and programming support for composite events. We have implemented the presented approach for our content-based publish/subscribe middleware REBECA.

关键词： content-based publish/subscribe middleware programming abstractions composite events

来源：评论

学校读者我要写书评

暂无评论

Architectural Implications of GNN Aggregation programming abstractions

IEEE COMPUTER ARCHITECTURE LETTERS

引用

IEEE COMPUTER ARCHITECTURE LETTERS 2024年第1期23卷 125-128页

作者： Qi, Yingjie Yang, Jianlei Zhou, Ao Qiao, Tong Hu, Chunming Beihang Univ Sch Comp Sci & Engn Beijing 100191 Peoples R China

Graph neural networks (GNNs) have gained significant popularity due to the powerful capability to extract useful representations from graph data. As the need for efficient GNN computation intensifies, a variety of programming abstractions designed for optimizing GNN Aggregation have emerged to facilitate acceleration. However, there is no comprehensive evaluation and analysis upon existing abstractions, thus no clear consensus on which approach is better. In this letter, we classify existing programming abstractions for GNN Aggregation by the dimension of data organization and propagation method. By constructing these abstractions on a state-of-the-art GNN library, we perform a thorough and detailed characterization study to compare their performance and efficiency, and provide several insights on future GNN acceleration based on our analysis.

关键词： programming Graph neural networks Organizations Kernel Indexes Graphics processing units Taxonomy Graph neural networks (GNNs) characterization programming abstractions execution patterns

来源：评论

学校读者我要写书评

暂无评论

Towards Real-Time Aggregate Computing 12th

Towards Real-Time Aggregate Computing

引用

12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation

作者： Audrito, Giorgio Damiani, Ferruccio Torta, Gianluca Univ Torino Turin Italy

ISBN: (纸本)9783031751066;9783031751073

Developing large-scale collective adaptive systems for safety-critical applications requires an extensive effort, involving the interplay of distributed programming techniques and mathematical proofs of real-time guarantees. This effort could be significantly reduced by allowing the system developer to rely on libraries of predefined algorithms. By exploiting such algorithms, distributed behaviour and (hard) real-time guarantees for the final application could be automatically inferred, effectively shifting the verification burden from the system designer to the algorithm developer. Following earlier work on real-time guarantees for aggregate computing algorithms, we argue that aggregate computing could provide a convenient framework towards this aim. As a first step, we give a detailed description of different kinds of models that abstract aggregate programs as mathematical functions. Then, building on such models, we start investigating the problem of how real-time behavior constraints could be specified in a compositional way. Finally, we conclude by singling out a number of potential building block library algorithms that could constitute such a real-time aggregate computing library, with the potential of providing a valuable asset for supporting the rigorous engineering of safety-critical large-scale collective adaptive systems.

关键词： Self-organising systems Real-time guarantees Aggregate Computing programming abstractions

来源：评论

学校读者我要写书评

暂无评论

Trends in Data Locality abstractions for HPC Systems

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2017年第10期28卷 3007-3020页

作者： Unat, Didem Dubey, Anshu Hoefler, Torsten Shalf, John Abraham, Mark Bianco, Mauro Chamberlain, Bradford L. Cledat, Romain Edwards, H. Carter Finkel, Hal Fuerlinger, Karl Hannig, Frank Jeannot, Emmanuel Kamil, Amir Keasler, Jeff Kelly, Paul H. J. Leung, Vitus Ltaief, Hatem Maruyama, Naoya Newburn, Chris J. Pericas, Miquel Koc Univ Dept Comp Engn TR-34450 Istanbul Turkey Argonne Natl Lab 9700 S Cass Ave Argonne IL 60439 USA ETH CH-8092 Zurich Switzerland Lawrence Berkeley Natl Lab Berkeley CA 94720 USA KTH Royal Inst Technol S-17121 Solna Sweden Swiss Natl Supercomp Ctr CH-6900 Lugano Switzerland Cray Inc Seattle WA 98164 USA Intel Cooperat Santa Clara CA 95050 USA Sandia Natl Labs POB 5800 Albuquerque NM 87185 USA Argonne Natl Lab 9700 S Cass Ave Argonne IL 60439 USA Ludwig Maximilians Univ Munchen D-80538 Munich Germany Univ Erlangen Nurnberg D-91058 Erlangen Germany INRIA Bordeaux Sud Ouest F-33405 Talence France Univ Michigan Ann Arbor MI 48109 USA Lawrence Berkeley Natl Lab Berkeley CA 94720 USA Lawrence Livermore Natl Lab Livermore CA 94550 USA Imperial Coll London Software Technol London England King Abdullah Univ Sci & Technol Thuwal 23955 Saudi Arabia RIKEN Kobe Hyogo 6500047 Japan Nvidia Corp Santa Clara CA 95050 USA Chalmers Univ Technol S-41296 Gothenburg Sweden

The cost of data movement has always been an important concern in high performance computing (HPC) systems. It has now become the dominant factor in terms of both energy consumption and performance. Support for expression of data locality has been explored in the past, but those efforts have had only modest success in being adopted in HPC applications for various reasons. them However, with the increasing complexity of the memory hierarchy and higher parallelism in emerging HPC systems, locality management has acquired a new urgency. Developers can no longer limit themselves to low-level solutions and ignore the potential for productivity and performance portability obtained by using locality abstractions. Fortunately, the trend emerging in recent literature on the topic alleviates many of the concerns that got in the way of their adoption by application developers. Data locality abstractions are available in the forms of libraries, data structures, languages and runtime systems;a common theme is increasing productivity without sacrificing performance. This paper examines these trends and identifies commonalities that can combine various locality concepts to develop a comprehensive approach to expressing and managing data locality on future large-scale high-performance computing systems.

关键词： Data locality programming abstractions high-performance computing data layout locality-aware runtimes

来源：评论

学校读者我要写书评

暂无评论

State-centric programming for sensor-actuator network systems

引用

IEEE PERVASIVE COMPUTING 2003年第4期2卷 50-62页

作者： Liu, J Chu, M Liu, J Reich, J Zhao, F Xerox Corp Palo Alto Res Ctr Palo Alto CA 94304 USA

Networked embedded systems must be able to rapidly respond to all kinds of sensing events, even though they have numerous failure-prone nodes and limited energy and bandwidth resources. The design methodology and software environment described here mediate, between the developer's mental model of physical phenomena and the distributed application.

关键词： Sensor Networks Embedded System Organization Models Of Collaboration programming abstractions Object Tracking Applications

来源：评论

学校读者我要写书评

暂无评论

An open framework for translating portable applications into operating system-specific wireless sensor networks applications

引用

SOFTWARE-PRACTICE & EXPERIENCE 2013年第3期43卷 333-357页

作者： Escolar, Soledad Carretero, Jesus Univ Carlos III Madrid Dept Comp Sci Madrid 28911 Spain

Wireless sensor networks (WSNs) are distributed systems integrated by tiny devices, called sensor nodes, with capabilities to monitor the environment and forward their measurements to a special node, the sink, where the results can be collected and further processed. The trend in WSN is moving towards heterogeneous networks that will contain different sensor nodes running different instances of custom operating systems. Given the growing demand of new hardware platforms and operating systems specifically designed for sensor nodes, the applications programming for sensor nodes is becoming a challenging process that needs to be alleviated. Currently, application programming for sensor nodes is a complex, ad hoc, and error-prone process where the portability among different platforms has been sacrificed. In this paper, we propose an open framework aimed to achieve application portability in heterogeneous sensor networks. Our approach provides the programming abstractions needed to support the application development process for sensor nodes. We have implemented an open framework that provides a set of tools on top of the most popular WSN operating systems to translate portable applications to the native operating system in an automatic, simple, and transparent way for developers. We have also evaluated the applications thus generated in terms of productivity and overhead, by comparing their footprint to those originally developed in each specific operating system. The results show that the overhead is minimal4% in the worst caseand in some cases, it was even possible to reduce the footprint by using code optimizations. Copyright (c) 2012 John Wiley & Sons, Ltd.

关键词： efficient applications programming programming abstractions portability operating systems wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

SPGPU: Spatially Programmed GPU

IEEE COMPUTER ARCHITECTURE LETTERS

引用

IEEE COMPUTER ARCHITECTURE LETTERS 2024年第2期23卷 223-226页

作者： Zhu, Shizhuo Shkirko, Illia Levinson, Jacob Wang, Zhengrong Nowatzki, Tony Univ Calif Los Angeles Los Angeles CA 90095 USA

Communication is a critical bottleneck for GPUs, manifesting as energy and performance overheads due to network-on-chip (NoC) delay and congestion. While many algorithms exhibit locality among thread blocks and accessed data, modern GPUs lack the interface to exploit this locality: GPU thread blocks are mapped to cores obliviously. In this work, we explore a simple extension to the conventional GPU programming interface to enable control over the spatial placement of data and threads, yielding new opportunities for aggressive locality optimizations within a GPU kernel. Across 7 workloads that can take advantage of these optimizations, for a 32 (or 128) SM GPU: we achieve a 1.28x (1.54x) speedup and 35% (44%) reduction in NoC traffic, compared to baseline non-spatial GPUs.

关键词： Instruction sets Graphics processing units Message systems programming Topology Hardware Kernel Optimization Registers Pipelines Spatial architectures GPU programming abstractions shared-data locality on-chip networks

来源：评论

学校读者我要写书评

暂无评论

programming mobile context-aware applications with TOTAM

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2014年第1期92卷 3-19页

作者： Boix, Elisa Gonzalez Scholliers, Christophe De Meuter, Wolfgang D'Hondt, Theo Vrije Univ Brussel Software Languages Lab B-1050 Brussels Belgium

In tuple space approaches to context-aware mobile systems, the notion of context is defined by the presence or absence of certain tuples in the tuple space. Existing approaches define such presence either by collocation of devices holding the tuples or by replication of tuples across all devices. We show that both approaches can lead to an erroneous perception of context. Collocation ties the perception of context to network connectivity which does not always yield the expected result. Tuple replication can cause that a certain context is perceived even if the device has left the context a long time ago. We propose a tuple space approach in which tuples themselves carry a predicate that determines whether they are in the right context or not. We present a practical API for our approach and show its use by means of the implementation of various mobile applications. Benchmarks show that our approach can lead to a significant increase in performance compared to other approaches. (C) 2013 Elsevier Inc. All rights reserved.

关键词： Tuple spaces programming abstractions Context-awareness

来源：评论

学校读者我要写书评

暂无评论

Signal/Collect Processing large graphs in seconds

引用

SEMANTIC WEB 2016年第2期7卷 139-166页

作者： Stutz, Philip Strebel, Daniel Bernstein, Abraham Univ Zurich CH-8006 Zurich Switzerland

Both researchers and industry are confronted with the need to process increasingly large amounts of data, much of which has a natural graph representation. Some use MapReduce for scalable processing, but this abstraction is not designed for graphs and has shortcomings when it comes to both iterative and asynchronous processing, which are particularly important for graph algorithms. This paper presents the Signal/Collect programming model for scalable synchronous and asynchronous graph processing. We show that this abstraction can capture the essence of many algorithms on graphs in a concise and elegant way by giving Signal/Collect adaptations of algorithms that solve tasks as varied as clustering, inferencing, ranking, classification, constraint optimisation, and even query processing. Furthermore, we built and evaluated a parallel and distributed framework that executes algorithms in our programming model. We empirically show that our framework efficiently and scalably parallelises and distributes algorithms that are expressed in the programming model. We also show that asynchronicity can speed up execution times. Our framework can compute a PageRank on a large (>1.4 billion vertices, >6.6 billion edges) real-world graph in 112 seconds on eight machines, which is competitive with other graph processing approaches.

关键词： Distributed computing scalability programming abstractions programming models graph processing

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：