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

28th acm symposium on Operating Systems principles (SOSP)

作者： Helt, Jeffrey Burke, Matthew Levy, Amit Lloyd, Wyatt Princeton Univ Princeton NJ 08544 USA Cornell Univ Ithaca NY USA

ISBN: (纸本)9781450387095

Strictly serializable (linearizable) services appear to execute transactions (operations) sequentially, in an order consistent with real time. This restricts a transaction's (operation's) possible return values and in turn, simplifies application programming. In exchange, strictly serializable (linearizable) services perform worse than those with weaker consistency. But switching to such services can break applications. This work introduces two new consistency models to ease this trade-off: regular sequential serializability (RSS) and regular sequential consistency (RSC). They are just as strong for applications: we prove any application invariant that holds when using a strictly serializable ( linearizable) service also holds when using an RSS (RSC) service. Yet they relax the constraints on servicesDthey allow new, better-performing designs. To demonstrate this, we design, implement, and evaluate variants of two systems, Spanner and Gryff, relaxing their consistency to RSS and RSC, respectively. The new variants achieve better read-only transaction and read tail latency than their counterparts.

关键词： distributed systems consistency databases

来源：评论

学校读者我要写书评

暂无评论

Smartphones as a Platform for Hands-On Internet of Things Education 2023

Smartphones as a Platform for Hands-On Internet of Things Ed...

引用

proceedings of the 54th acm Technical symposium on Computer Science Education V. 2

作者： Devin Jean Ákos Lédeczi Vanderbilt University Nashville TN USA

ISBN: (纸本)9781450394338

While some high school courses like AP Computer Science principles cover topics such as the internet, they do not typically include hands-on activities on the Internet of Things (IoT) and related concepts like distributed computing. Notable reasons include the complexity of programming distributed systems and the cost of supplying classrooms with the necessary hardware. However, most students already have access to a smartphone or other mobile device, which contains all the necessary hardware to introduce these topics through highly engaging interactive projects. We introduce an open-source mobile app called PhoneIoT that allows students to remotely access their devices and query live sensor data or manipulate the app's customizable interactive display. Unlike other tools such as App Inventor, PhoneIoT is not an app-creation tool; instead, we take a distributed approach, with students' code running on their computers and remotely accessing the phone. This makes it possible to have multiple student programs connect to a single device, or one program connect to multiple devices, creating a truly distributed application. To target broad audiences, PhoneIoT supports simple programming interfaces in both block-based form through NetsBlox (a networking-oriented fork of Snap!) and text form through PyBlox (a Python library). This demonstration will include the basic information needed to install and use PhoneIoT, an interactive walkthrough of a compelling NetsBlox project that students could complete on their first day using PhoneIoT, and finally some interesting projects implemented in Python.

关键词： distributed computing internet of things block-based languages mobile devices remote sensing

来源：评论

学校读者我要写书评

暂无评论

distributed Quantum Advantage for Local Problems 25

Distributed Quantum Advantage for Local Problems

引用

proceedings of the 57th Annual acm symposium on Theory of computing

作者： Alkida Balliu Sebastian Brandt Xavier Coiteux-Roy Francesco d'Amore Massimo Equi François Le Gall Henrik Lievonen Augusto Modanese Dennis Olivetti Marc-Olivier Renou Jukka Suomela Lucas Tendick Isadora Veeren Gran Sasso Science Institute L'Aquila Italy CISPA Helmholtz Center for Information Security Saarbrücken Germany University of Calgary Calgary Canada Technical University of Munich Munich Germany MCQST Munich Germany Bocconi University Milan Italy BIDSA Milan Italy Aalto University Espoo Finland Nagoya University Nagoya Japan Inria - Université Paris-Saclay - CPHT - LIX - Ecole Polytechnique - Institut Polytechnique de Paris Palaiseau France

ISBN: (纸本)9798400715105

We present the first local problem that shows a super-constant separation between the classical randomized LOCAL model of distributed computing and its quantum counterpart. By prior work, such a separation was known only for an artificial graph problem with an inherently global definition [Le Gall et al. 2019].We present a problem that we call iterated GHZ, which is defined using only local constraints. Formally, it is a family of locally checkable labeling problems [Naor and Stockmeyer 1995]; in particular, solutions can be verified with a constant-round distributed *** show that in graphs of maximum degree Δ, any classical (deterministic or randomized) LOCAL model algorithm will require Ω(Δ) rounds to solve the iterated GHZ problem, while the problem can be solved in 1 round in *** use the round elimination technique to prove that the iterated GHZ problem requires Ω(Δ) rounds for classical algorithms. This is the first work that shows that round elimination is indeed able to separate the two models, and this also demonstrates that round elimination cannot be used to prove lower bounds for quantum-LOCAL. To apply round elimination, we introduce a new technique that allows us to discover appropriate problem relaxations in a mechanical way; it turns out that this new technique extends beyond the scope of the iterated GHZ problem and can be used to e.g. reproduce prior results on maximal matchings [FOCS 2019, PODC 2020] in a systematic manner.

关键词： distributed computing

来源：评论

学校读者我要写书评

暂无评论

Demo: The First Open AR Cloud Testbed 20

Demo: The First Open AR Cloud Testbed

引用

20th IEEE International symposium on Mixed and Augmented Reality (ISMAR)

作者： Jackson, James Vogt, Michael Soros, Gabor Salazar, Mikel Fedorenko, Sergey Open AR Cloud Portland OR 97217 USA Open AR Cloud Assoc Portland OR 97217 USA Open AR Cloud Europe gUG Portland OR 97217 USA

ISBN: (纸本)9781665412988

We present the first deployment of an open, scalable and distributed spatial computing platform. We show in action its extensible protocols for discovering spatial services and spatial content in a geographic area, representing poses of real and virtual cameras and objects, exchanging content records, and interfacing with spatial computing services like visual localization. We also demonstrate the usage of the platform through a WebXR reference client in the first city-wide prototype testbed in Bari, Italy.

关键词： Human-centered computing Mixed/augmented reality Human-centered computing Ubiquitous and mobile computing systems and tools Networks Location based services

来源：评论

学校读者我要写书评

暂无评论

Time-Sensitive Networking over Metropolitan Area Networks for Remote Industrial Control 25

Time-Sensitive Networking over Metropolitan Area Networks fo...

引用

25th IEEE/acm International symposium on distributed Simulation and Real Time Applications (DS-RT)

作者： Tschoeke, Simon Lynker, Frederic Buhr, Hauke Schreiner, Florian Willner, Alexander Vick, Axel Chemnitz, Moritz German Edge Cloud Res Dept Eschborn Germany Fraunhofer FOKUS Software Based Networks Berlin Germany Fraunhofer IPK Automat & Robot Berlin Germany

ISBN: (纸本)9781665433266

The benefits of the currently evolving IEEE TimeSensitive Networking (TSN) standard have already been globally recognized. Whereas the application of TSN in a LAN is currently widely and globally tested, TSN in a Metropolitan Area Network (MAN) has not been a major focus until now. The possible benefits of utilizing co-located Edge Clouds in order to support multiple urban production sites with industrial realtime applications open a wide range of new business models. Therefore, we have analyzed the feasibility of transparently using PROFINET over TSN via a Dense Wavelength Division Multiplex (DWDM) link, where a machine park is controlled remotely by an Edge-based virtual Programmable Logic Controller (vPLC). As a result, we are able to setup a TSN connection over a MAN with a one-way delay of about 156.5 mu s and a jitter of about 12 ns. This work can be extended to allow for dynamically provisioned TSN flows and multi-path Frame Replication and Elimination (FRER) for distributed hard real-time machine control and adoption to Ultra-Reliable Low-Latency Communication (URLLC) 5G campus networks.

关键词： TSN Edge computing IoT IIoT Industry 4.0 5G URLLC PLC vPLC MAN PTP gPTP

来源：评论

学校读者我要写书评

暂无评论

Compiler support for near data computing 21

Compiler support for near data computing

引用

26th acm SIGPLAN symposium on principles and Practice of Parallel Programming, PPoPP 2021

作者： Kandemir, Mahmut Taylan Ryoo, Jihyun Tang, Xulong Karakoy, Mustafa Kandemir Penn State University United States Penn State University United States University of Pittsburgh United States TUBITAK-BILGEM Turkey

ISBN: (纸本)9781450382946

Recent works from both hardware and software domains offer various optimizations that try to take advantage of near data computing (NDC) opportunities. While the results from these works indicate performance improvements of various magnitudes, the existing literature lacks a detailed quantification of the potential of NDC and analysis of compiler optimizations on tapping into that potential. This paper first presents an analysis of the NDC potential when executing multithreaded applications on manycore platforms. It then presents two compiler schemes designed to take advantage of NDC. The first of these schemes try to increase the amount of computation that can be performed in a hardware component, whereas the second compiler strategy strikes a balance between optimizing NDC and exploiting data reuse, by being more selective on when to perform NDC (even if the opportunity presents itself) and how. The collected experimental results on a 5×5 manycore system reveal that our first and second compiler schemes improve the overall performance of our multithreaded applications by, respectively, 22.5% and 25.2%, on average. Furthermore, these two compiler schemes are only 6.8% and 4.1% worse than an oracle scheme that makes the best near data computing decisions for each and every computation. © 2021 acm.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

2021 principles of distributed computing Doctoral Dissertation Award

Proceedings of the Annual ACM Symposium on Principles of Dis...

引用

proceedings of the Annual acm symposium on principles of distributed computing 2021年 III-IV页

作者： Aguilera, Marcos K. Attiya, Hagit Cachin, Christian Panconesi, Alessandro VMWare Palo Alto United States Technion Haifa Israel University of Bern Switzerland Sapienza University of Rome Rome Italy

来源：评论

学校读者我要写书评

暂无评论

EGEMM-TC: Accelerating scientific computing on tensor cores with extended precision 21

EGEMM-TC: Accelerating scientific computing on tensor cores ...

引用

26th acm SIGPLAN symposium on principles and Practice of Parallel Programming, PPoPP 2021

作者： Feng, Boyuan Wang, Yuke Chen, Guoyang Zhang, Weifeng Xie, Yuan Ding, Yufei University of California United States Alibaba Group Us Inc. China

ISBN: (纸本)9781450382946

Nvidia Tensor Cores achieve high performance with half-precision matrix inputs tailored towards deep learning workloads. However, this limits the application of Tensor Cores especially in the area of scientific computing with high precision requirements. In this paper, we build Emulated GEMM on Tensor Cores (EGEMM-TC) to extend the usage of Tensor Cores to accelerate scientific computing applications without compromising the precision requirements. First, EGEMM-TC employs an extendable workflow of hardware profiling and operation design to generate a lightweight emulation algorithm on Tensor Cores with extended-precision. Second, EGEMM-TC exploits a set of Tensor Core kernel optimizations to achieve high performance, including the highly-efficient tensorization to exploit the Tensor Core memory architecture and the instruction-level optimizations to coordinate the emulation computation and memory access. Third, EGEMM-TC incorporates a hardware-aware analytic model to offer large flexibility for automatic performance tuning across various scientific computing workloads and input datasets. Extensive evaluations show that EGEMM-TC can achieve on average 3.13× and 11.18× speedup over the cuBLAS kernels and the CUDA-SDK kernels on CUDA Cores, respectively. Our case study on several scientific computing applications further confirms that EGEMM-TC can generalize the usage of Tensor Cores and achieve about 1.8× speedup compared to the hand-tuned, highly-optimized implementations running on CUDA Cores. © 2021 acm.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Semantic Privacy-Preserving for Video Surveillance Services on the Edge 23

Semantic Privacy-Preserving for Video Surveillance Services ...

引用

proceedings of the Eighth acm/IEEE symposium on Edge computing

作者： Alexander Y. C. Huang Yitao Chen Dijiang Huang Ming Zhao Arizona State University Tempe Arizona USA

ISBN: (纸本)9798400701238

Intelligent Video surveillance systems, leveraging edge computing, have become increasingly prevalent in various facilities, providing advanced monitoring and management capabilities. However, these systems can inadvertently compromise personally identifiable information, such as human images, leading to privacy violations. We introduced a semantic privacy-preserving video surveillance service on the edge to address this critical issue. Unlike traditional centralized models, the solution operates as a decentralized machine learning framework within the video surveillance infrastructure at the edge. Its primary focus is protecting private information extracted from captured video streaming data. This research integrates cutting-edge machine learning techniques, including scene graph generation and semantic communication approaches, by enabling edge nodes to exchange parameters for training, referencing, and safeguarding data privacy and ownership. These innovations collectively contribute to the protection of human privacy. The performance evaluation confirms that the solution is an efficient and effective privacy protection platform, offering a significant advancement over conventional centralized solutions.

关键词： distributed training

来源：评论

学校读者我要写书评

暂无评论

Constant Degree Networks for Almost-Everywhere Reliable Transmission 25

Constant Degree Networks for Almost-Everywhere Reliable Tran...

引用

proceedings of the 57th Annual acm symposium on Theory of computing

作者： Mitali Bafna Dor Minzer Massachusetts Institute of Technology Cambridge USA

ISBN: (纸本)9798400715105

In the almost-everywhere reliable message transmission problem, introduced by [Dwork, Pippenger, Peleg, Upfal’86], the goal is to design a sparse communication network G that supports efficient, fault-tolerant protocols for interactions between all node pairs. By fault-tolerant, we mean that that even if an adversary corrupts a small fraction of vertices in G, then all but a small fraction of vertices can still communicate perfectly via the constructed protocols. Being successful to do so allows one to simulate, on a sparse graph, any fault-tolerant distributed computing task and secure multi-party computation protocols built for a complete network, with only minimal overhead in efficiency. Previous works on this problem achieved either constant-degree networks tolerating o(1) faults, constant-degree networks tolerating a constant fraction of faults via inefficient protocols (exponential work complexity), or poly-logarithmic degree networks tolerating a constant fraction of faults. We show a construction of constant-degree networks with efficient protocols (i.e., with polylogarithmic work complexity) that can tolerate a constant fraction of adversarial faults, thus solving the main open problem of Dwork et al. Our main contribution is a composition technique for communication networks, based on graph products. Our technique combines two networks tolerant to adversarial edge-faults to construct a network with a smaller degree while maintaining efficiency and fault-tolerance. We apply this composition result multiple times, using the polylogarithmic-degree edge-fault tolerant networks constructed in a recent work of [Bafna, Minzer, Vyas’24] (that are based on high-dimensional expanders) with itself, and then with the constant-degree networks (albeit with inefficient protocols) of [Upfal’92].

关键词： distributed computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：