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

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

作者： Sheikh Ghafoor Charles Weems Alan Sussman Ramachandran Vaidyanathan Sushil Prasad Tennessee Tech University Cookeville TN USA University of Massachusetts Amherst MA USA University of Maryland College Park MD USA Louisiana State University Baton Rouge LA USA University of Texas at San Antonio San Antonio TX USA

ISBN: (纸本)9781450394338

Parallel and distributed computing (PDC) has become pervasive in all aspects of computing, and thus it is essential that students include parallelism and distribution in the computational thinking that they apply to problem solving, from the very beginning. Computer science education is still teaching to a 20th century model of algorithmic problem solving. Sequence, branch, and loop are taught in our early courses as the only organizing principles needed for algorithms, and we invest considerable time in showing how best to sequentially process large volumes of data. All computing devices that students use currently have multiple cores as well as a GPU in many cases. Most of their favorite applications use multiple cores and numbers of distributed processors. Often concurrency offers simpler solutions than sequential approaches. Industry is desperate for software engineers who think naturally in terms of exploiting these capabilities, rather than seeing them as an exotic upper-level topic that gets layered over a sequential solution. However, we are still teaching students to solve problems using sequential thinking. In this workshop we overview key PDC concepts and provide examples of how they may naturally be incorporated in early computing classes. We will introduce plugged and unplugged curriculum modules that have been successfully integrated in existing computing classes at multiple institutions. We will highlight the upcoming summer training workshop, for which we have funding to support attendance, as well as other CDER (Center for Parallel and distributed computing Curriculum Development and Educational Resources) activities.

关键词： hpc education pdc education shared memory parallel programming computing education early computing class

来源：评论

学校读者我要写书评

暂无评论

TwinVisor: Hardware-isolated Confidential Virtual Machines for ARM 21

TwinVisor: Hardware-isolated Confidential Virtual Machines f...

引用

28th acm symposium on Operating Systems principles (SOSP)

作者： Li, Dingji Mi, Zeyu Xia, Yubin Zang, Binyu Chen, Haibo Guan, Haibing Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst Shanghai Peoples R China Shanghai Jiao Tong Univ AI Inst MoE Key Lab Artificial Intelligence Shanghai Peoples R China Minist Educ Engn Res Ctr Domain Specif Operating Syst Beijing Peoples R China Shanghai Jiao Tong Univ Shanghai Key Lab Scalable Comp & Syst Shanghai Peoples R China

ISBN: (纸本)9781450387095

Confidential VM, which offers an isolated execution environment for cloud tenants with limited trust in the cloud provider, has recently been deployed in major clouds such as AWS and Azure. However, while ARM has become increasingly popular in cloud data centers, existing confidential VM designs mainly leverage specialized x86 hardware extensions (e.g., AMD SEV and Intel TDX) to isolate VMs upon a shared hypervisor. This paper proposes TwinVisor, the first system that enables the hardware-enforced isolation of confidential VMs on ARM platforms. TwinVisor takes advantage of the mature ARMTrustZone to run two isolated hypervisors, one in the secure world (called S-visor in this paper) and the other in the normal world (called N-visor), to support normal VMs and confidential VMs respectively. Instead of building a new S-visor from scratch, our design decouples protection from resource management, and reuses most functionalities of a full-fledged N-visor to minimize the size of S-visor. We have built two prototypes of TwinVisor: one on an official ARM simulator with S-EL2 enabled to validate functional correctness and the other on an ARM development board to evaluate performance. The S-visor comprises 5.8K LoCs while the N-visor introduces 906 LoC changes to KVM. According to our evaluation, TwinVisor can run unmodified VM images as confidential VMs while incurring less than 5% performance overhead for various real-world workloads on SMP VMs.

关键词： Cloud computing Virtualization Confidential computing ARM TrustZone

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Single-Source Shortest Paths in the CONGEST Model with Improved Bound 20

Single-Source Shortest Paths in the CONGEST Model with Impro...

引用

39th symposium on principles of distributed computing

作者： Chechik, Shiri Mukhtar, Doron Tel Aviv Univ Tel Aviv Israel

ISBN: (纸本)9781450375825

We improve the time complexity of the single-source shortest path problem for weighted directed graphs (with non-negative integer weights) in the Broadcast CONGEST model of distributed computing. For polynomially bounded edge weights, the state-of-the-art algorithm for this problem requires (O) over tilde (min root nD(1/2), root nD(1/4) +n(3/5) + D}) rounds [Forster and Nanongkai, FOCS 2018], which is quite far from the known lower bound of (O) over tilde(root n + D) rounds [Elkin, STOC 2014];here D is the diameter of the underlying network and n is the number of vertices in it. For the approximate version of this problem, Forster and Nanongkai [FOCS 2018] obtained an upper bound of (O) over tilde (root nD(1/4) + D), and stated that achieving the same bound for the exact case remains a major open problem. In this paper we resolve the above mentioned problem by devising a new randomized algorithm for solving (the exact version of) this problem in (O) over tilde(root nD(1/4) + D) rounds. Our algorithm is based on a novel weight-modifying technique that allows us to compute bounded-hop distance approximation that preserves a certain form of the triangle inequality for the edges in the graph.

关键词： Broadcast CONGEST single-source shortest paths distributed algorithms overlay networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Classification of distributed Binary Labeling Problems* 20

Brief Announcement: Classification of Distributed Binary Lab...

引用

39th symposium on principles of distributed computing

作者： Balliu, Alkida Brandt, Sebastian Efron, Yuval Hirvonen, Juho Maus, Yannic Olivetti, Dennis Suomela, Jukka Univ Freiburg Freiburg Germany Swiss Fed Inst Technol Zurich Switzerland Technion Haifa Israel Aalto Univ Espoo Finland

ISBN: (纸本)9781450375825

We present a complete classification of the deterministic distributed time complexity for a family of graph problems: binary labeling problems in trees in the usual LOCAL model of distributed computing. These are locally checkable problems that can be encoded with an alphabet of size two in the edge labeling formalism. Examples of binary labeling problems include sinkless orientation, sinkless and sourceless orientation, 2-vertex coloring, and perfect matching. We show that the complexity of any such problem is in one of the following classes: O(1), Theta(log n), Theta(n), or unsolvable. Furthermore, given the description of any binary labeling problem, we can easily determine in which of the four classes it is and what is an asymptotically optimal algorithm for solving it.

关键词： LOCAL model graph problems locally checkable labeling problems distributed computational complexity

来源：评论

学校读者我要写书评

暂无评论

proceedings of the Annual acm symposium on principles of distributed computing

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

引用

36th acm symposium on principles of distributed computing, PODC 2017

ISBN: (纸本)9781450349925

The proceedings contain 59 papers. The topics discussed include: exploiting spontaneous transmissions for broadcasting and leader election in radio networks;communication primitives in cognitive radio networks;analyzing contention and backoff in asynchronous shared memory;a layered architecture for erasure-coded consistent distributed storage;seeing is believing: a client-centric specification of database isolation;space complexity of fault-tolerant register emulations;brief announcement: readers of wait-free unbounded registers must write;brief announcement: fast shared counting using (O(n)) compare-and-swap registers;on the multiparty communication complexity of testing triangle-freeness;distributed MST and routing in almost mixing time;brief announcement: optimal address-oblivious epidemic dissemination;a simple deterministic distributed MST algorithm, with near-optimal time and message complexities;distributed approximation of maximum independent set and maximum matching;deterministic distributed (delta + o(delta))-edge-coloring, and vertex-coloring of graphs with bounded diversity;optimal distance labeling schemes for trees;randomized abortable mutual exclusion with constant amortized RMR complexity on the CC model;effectiveness of delaying timestamp computation;ignore or comply? on breaking symmetry in consensus;and greedy routing and the algorithmic small-world phenomenon.

关键词：

来源：评论

学校读者我要写书评

暂无评论

P³S: A High Accuracy Probabilistic Prediction Processing System for CNN Acceleration 22

P<SUP>3</SUP>S: A High Accuracy Probabilistic Prediction Pro...

引用

32nd Great Lakes symposium on VLSI (GLSVLSI)

作者： Xiao, Hang Xu, Haobo Chen, Xiaoming Wang, Yujie Han, Yinhe Univ Chinese Acad Sci Chinese Acad Sci Inst Comp Technol Res Ctr Intelligent Comp Syst Beijing Peoples R China

ISBN: (纸本)9781450393225

Convolutional Neural Networks (CNNs) achieve state-of-the-art performance for perception tasks at the cost of billions of computational operations. In this paper, we propose a probabilistic prediction processing system, dubbed (PS)-S-3, to eliminate redundant compute-heavy convolution operations by predicting whether output activations are zero-valued. By exploiting the probability characteristic of Gaussian-like distributed activations and weights in CNNs, (PS)-S-3 calculates the partial convolution across values greater than a standard deviation-related threshold, to predict the ineffectual output activations. (PS)-S-3 skips remaining convolutions and sets outputs to zero in advance if output activations are predicted to be zero. (PS)-S-3 reduces 67% computations within 0.2% accuracy loss and does not even require retraining or fine-tuning CNNs. We further implement a (PS)-S-3-based CNN accelerator that achieves 2.02x speedup and 2.23x energy efficiency on average over the traditional accelerator. Compared with the state-of-the-art prediction-based accelerator with 3% accuracy degradation, our (PS)-S-3 yields up to 1.49x speedup and 1.69x energy efficiency.

关键词： CNN accelerator predictive activation computation reduction approximate computing

来源：评论

学校读者我要写书评

暂无评论

Tight distributed Listing of Cliques 32

Tight Distributed Listing of Cliques

引用

32nd Annual acm-SIAM symposium on Discrete Algorithms (SODA)

作者： Censor-Hillel, Keren Chang, Yi-Jun Le Gall, Francois Leitersdorf, Dean Technion Haifa Israel Swiss Fed Inst Technol Zurich Switzerland Nagoya Univ Nagoya Aichi Japan

ISBN: (纸本)9781611976465

Much progress has recently been made in understanding the complexity landscape of subgraph finding problems in the CONGEST model of distributed computing. However, so far, very few tight bounds are known in this area. For triangle (i.e., 3-clique) listing, an optimal (O) over tilde (n(1/3))-round distributed algorithm has been constructed by Chang et al. [SODA 2019, PODC 2019]. Recent works of Eden et al. [DISC 2019] and of Censor-Hillel et al. [PODC 2020] have shown sublinear algorithms for K-p-listing, for each p >= 4, but still leaving a significant gap between the upper bounds and the known lower bounds of the problem. In this paper, we completely close this gap. We show that for each p >= 4, there is an (O) over tilde (n(1-2/p))-round distributed algorithm that lists all p-cliques K-p in the communication network. Our algorithm is optimal up to a polylogarithmic factor, due to the (Omega) over tilde (n(1-2/p))-round lower bound of Fischer et al. [SPAA 2018], which holds even in the CONGESTED CLIQUE model. Together with the trianglelisting algorithm by Chang et al. [SODA 2019, PODC 2019], our result thus shows that the round complexity of K-p-listing, for all p, is the same in both the CONGEST and CONGESTED CLIQUE models, at (Theta) over tilde (n(1-2/p)) rounds. For p = 4, our result additionally matches the (Omega) over tilde (n(1/2)) lower bound for K-4 -detection by Czumaj and Konrad [DISC 2018], implying that the round complexities for detection and listing of K-4 are equivalent in the CONGEST model.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta 20

Distributed Edge Coloring in Time Quasi-Polylogarithmic in D...

引用

39th symposium on principles of distributed computing

作者： Balliu, Alkida Kuhn, Fabian Olivetti, Dennis Univ Freiburg Freiburg Germany

ISBN: (纸本)9781450375825

The problem of coloring the edges of an n-node graph of maximum degree. with 2 Delta - 1 colors is one of the key symmetry breaking problems in the area of distributed graph algorithms. While there has been a lot of progress towards the understanding of this problem, the dependency of the running time on. has been a long-standing open question. Very recently, Kuhn [SODA '20] showed that the problem can be solved in time 2O(root log Delta) + O(log* n). In this paper, we study the edge coloring problem in the distributed LOCAL model. We show that the (degree + 1)-list edge coloring problem, and thus also the (2 Delta- 1)-edge coloring problem, can be solved deterministically in time 2(O(log2 log Delta))+ O(log* n). This is a significant improvement over the result of Kuhn [SODA '20].

关键词： LOCAL model graph problems graph coloring edge coloring

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：