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

31st International symposium on High-Performance Parallel and distributed computing, HPDC 2022

作者： Lofstead, Jay Maltzahn, Carlos Jimenez, Ivo Sandia National Laboratories AlbuquerqueNM United States University of California Santa CruzCA United States

ISBN: (纸本)9781450391993

The P-RECS workshop focuses heavily on practical, actionable aspects of reproducibility in broad areas of computational science and data exploration, with special emphasis on issues in which community collaboration can be essential for adopting novel methodologies, techniques and frameworks aimed at addressing some of the challenges we face today. The workshop brings together researchers and experts to share experiences and advance the state of the art in the reproducible evaluation of computer systems, featuring contributed papers and invited talks. © 2022 Owner/Author.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

HPDC 2022 - proceedings of the 31st International symposium on High-Performance Parallel and distributed computing

HPDC 2022 - Proceedings of the 31st International Symposium ...

引用

31st International symposium on High-Performance Parallel and distributed computing, HPDC 2022

ISBN: (纸本)9781450391993

The proceedings contain 32 papers. The topics discussed include: DAOS: data access-aware operating system;FPVM: towards a floating point virtual machine;lifting and dropping VMs to dynamically transition between time- and space-sharing for large-scale HPC systems;access patterns and performance behaviors of multi-layer supercomputer I/O subsystems under production load;capri: compiler and architecture support for whole-system persistence;understanding memory failures on a petascale arm system;SchedInspector: a batch job scheduling inspector using reinforcement learning;Holmes: SMT interference diagnosis and CPU scheduling for job co-location;TLPGNN: a lightweight two-level parallelism paradigm for graph neural network computation on GPU;and TAC: optimizing error-bounded lossy compression for three-dimensional adaptive mesh refinement simulations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

POSTER: Hardening Selective Protection across Multiple Program Inputs for HPC Applications 27

POSTER: Hardening Selective Protection across Multiple Progr...

引用

27th acm SIGPLAN symposium on principles and Practice of Parallel Programming (PPoPP)

作者： Huang, Yafan Guo, Shengjian Di, Sheng Li, Guanpeng Cappello, Franck Univ Iowa Iowa City Iowa IA USA Baidu Secur Sunnyvale CA USA Argonne Natl Lab Lemont Lemont IL USA

ISBN: (纸本)9781450392044

With the ever-shrinking size of transistors and increasing scale of applications, silent data corruptions (SDCs) have become a common yet serious issue in HPC applications. Selective instruction duplication (SID) is a popular fault-tolerance technique that can obtain a high SDC coverage with low-performance overhead, as it selects the most vulnerable parts of a program for protection with priority. However, existing studies of SID are confined to single program input in the evaluation, assuming that the error resilience of the program remains similar across inputs, leading to a drastic loss of SDC coverage from SID when the protected program runs different inputs. Hence, we proposed Sentinel, an automated compiler-based framework to mitigate the loss of SDC coverage. Evaluation results show that Sentinel can effectively mitigate the loss of SDC coverage (up to 97.00%) across multiple inputs, which significantly hardens existing SID techniques.

关键词： Error Resilience Fault Injection Compiler High Performance computing

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Energy-Efficient Maximal Independent Sets in Radio Networks 25

Brief Announcement: Energy-Efficient Maximal Independent Set...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Dominick Banasik Varsha Dani Fabien Dufoulon Aayush Gupta Thomas Hayes Gopal Pandurangan Rochester Institute of Technology Rochester USA Lancaster University Lancaster United Kingdom University of Houston Houston Texas USA University at Buffalo Buffalo USA

ISBN: (纸本)9798400718854

Maximal Independent Set (MIS) is one of the most fundamental problems in distributed computing, and it has been studied intensively for over four decades. This paper focuses on the MIS problem in the radio networks model, a standard model widely used to model wireless networks, particularly ad hoc wireless and sensor networks. Energy is a premium resource in these networks, which are typically battery-powered. Hence, designing distributed algorithms that use as little energy as possible is crucial. We use the well-established energy model where a node can be sleeping or awake in a round, and only the awake rounds (when it can send or listen) determine the energy complexity of the *** present the first energy-efficient MIS algorithms in radio networks with arbitrary and unknown graph topology. We present algorithms for two popular variants of the radio model - with collision detection (CD) and without collision detection (no-CD). Specifically, we obtain the following results:(1) CD model: We present a distributed MIS algorithm with O (log n) energy complexity (n is the network size). We also show a matching Ω (log n) lower bound for the energy complexity.(2) no-CD model: In the more challenging no-CD model, we present a distributed MIS algorithm with energy complexity O (log2 n log log n). The energy complexity of our algorithm is significantly lower than the round (and energy) complexity of O (log3 n) of the best-known distributed MIS algorithm of Davies [PODC 2023] for arbitrary graph topology.

关键词： distributed computing

来源：评论

学校读者我要写书评

暂无评论

Where's the bug? Helping students find errors in physical computing 2022

Where's the bug? Helping students find errors in physical co...

引用

53rd Annual acm Technical symposium on Computer Science Education, SIGCSE 2022

作者： Schneider, Michael University of Colorado Boulder BoulderCO United States

ISBN: (纸本)9781450390712

Playground have simplified programming and wiring, enabling students to quickly engineer physical computing projects. But enabling students to rapidly design and build is a double-edged sword: Students can create functioning prototypes without fully understanding the underlying principles. With limited knowledge and experience, students struggle to locate and fix bugs, or errors, in their projects. Absent appropriate debugging tools, students rely on their instructor for locating errors, or worse, turn toward destructive tactics such as tearing apart and rebuilding their project, hoping the bug fixes itself. Students need tools targeted to their ability that scaffold debugging and help them locate bugs in the mixed hardware/software environment of physical computing. I developed Circuit Check to scaffold the debugging process for students. It enables students to observe real-time sensor data and test hardware components through a novel adaptation of the traditional breakpoint for physical computing. © 2022 Owner/Author.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Cultivating Sense of Belonging in computing Education: Identifying Servingness Traits Among Community College Population 56

Cultivating Sense of Belonging in Computing Education: Ident...

引用

56th Annual SIGCSE Technical symposium on Computer Science Education, SIGCSE TS 2025

作者： Servin, Christian Becker, Brett A. Garcia, Emiliano El Paso Community College El Paso TX United States University College Dublin Belfield Ireland

ISBN: (纸本)9798400705328

Adversarial Thinking (AT) is essential in cybersecurity, fostering strategic problem-solving by anticipating worst-case scenarios. However, its integration into early computing education, especially in the first two years, remains underexplored. Introductory courses like CS 0 build foundational skills but are challenging to implement in resource-limited community colleges. Strengthening AT in these students can enhance their workforce readiness and support transfers to four-year programs. Servingness describes how Hispanic-Serving Institutions (HSIs) go beyond merely enrolling Latinx students to address their specific cultural, academic, and social needs. It involves creating inclusive environments where students feel a strong sense of belonging, supported by culturally relevant practices, leadership opportunities, and community engagement. These environments generate feelings of being accepted, valued, and included within a community or group, also called a sense of belonging. This work presents research focused on the incorporation of AT within the first two years of computer science education at community colleges, in particular to a course CS 0. By examining the integration of AT principles in early coursework, the study identifies key characteristics and a sense of belonging that are instrumental in cultivating AT capabilities among students. The findings aim to offer actionable insights for educators in community colleges, enabling them to more effectively prepare students for the complexities of modern computing careers and to address the broader needs of the cybersecurity field. Through this targeted educational approach, students can develop a more robust understanding of adversarial strategies, enhancing their overall computational thinking and problem-solving skills. © 2025 Copyright held by the owner/author(s).

关键词： adversarial thinking community colleges cs 1 sense of belonging servingness

来源：评论

学校读者我要写书评

暂无评论

Poster: distributed Inference for Multiple DNN Models in IoT Environments 23

Poster: Distributed Inference for Multiple DNN Models in IoT...

引用

23rd International symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile computing (MobiHoc)

作者： Jin, YoungHwan Park, HyungBin Lee, SuKyoung Yonsei Univ Seoul South Korea

ISBN: (纸本)9781450391658

Edge computing (EC) has been promising in providing support for Deep Neural Network (DNN) applications in IoT environments. However, resources in each edge are limited as response time increases. To reduce the latency, we propose to distribute the computation of multiple DNN models to nearby IoT devices. In particular, we propose a piece-wise multilevel partitioning and scheduling algorithm to improve the completion time of DNN inference.

关键词： IoT Multiple DNNs Piece-wise partitioning Offloading

来源：评论

学校读者我要写书评

暂无评论

Improved distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees 21

Improved Distributed Lower Bounds for MIS and Bounded (Out-)...

引用

40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Balliu, Alkida Brandt, Sebastian Kuhn, Fabian Olivetti, Dennis Univ Freiburg Freiburg Germany Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450385480

Recently, Balliu, Brandt, and Olivetti [FOCS '20] showed the first omega(log* n) lower bound for the maximal independent set (MIS) problem in trees. In this work we prove lower bounds for a much more relaxed family of distributed symmetry breaking problems. As a by-product, we obtain improved lower bounds for the distributed MIS problem in trees. For a parameter k and an orientation of the edges of a graph G, we say that a subset S of the nodes of G is a k-outdegree dominating set if S is a dominating set of G and if in the induced sub- graph G [S], every node in S has outdegree at most k. Note that for k = 0, this definition coincides with the definition of an MIS. For a given k, we consider the problem of computing a k-outdegree dominating set. We show that, even in regular trees of degree at most A, in the standard LOCAL model, there exists a constant omega > 0 such that for k <= Delta(epsilon), for the problem of computing a k-outdegree dominating set, any randomized algorithm requires at least Omega ( min {log Delta, root log log n}) rounds and any deterministic algorithm requires at least Omega ( min {log Delta, root log log n} ) rounds. The proof of our lower bounds is based on the recently highly successful round elimination technique. We provide a novel way to do simplifications for round elimination, which we expect to be of independent interest. Our new proof is considerably simpler than the lower bound proof in [FOCS '20]. In particular, our round elimination proof uses a family of problems that can be described by only a constant number of labels. The existence of such a proof for the MIS problem was believed impossible by the authors of [FOCS '20].

关键词： maximal independent set dominating set LOCAL model lower bounds

来源：评论

学校读者我要写书评

暂无评论

Ultra-Sparse Near-Additive Emulators 21

Ultra-Sparse Near-Additive Emulators

引用

40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Elkin, Michael Matar, Shaked Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel

ISBN: (纸本)9781450385480

Near-additive (aka (1 + epsilon, beta)-) emulators and spanners are a fundamental graph-algorithmic construct, with numerous applications for computing approximate shortest paths and related problems in distributed, streaming and dynamic settings. Known constructions of near-additive emulators enable one to trade between their sparsity (i.e., number of edges) and the additive stretch beta. Specifically, for any pair of parameters epsilon > 0, kappa = 1, 2, ..., one can have a (1 + epsilon, beta)-emulator with O(n(1+1/kappa)) edges, with beta = (log kappa/epsilon)(log kappa). At their sparsest, these emulators employ c . n edges, for some constant c >= 2. We tighten this bound, and show that in fact precisely n(1+1/kappa )edges suffice. In particular, our emulators can be ultra-sparse, i.e., we can have an emulator with n + o(n) edges and beta (log log n/epsilon)(log log n (1+o(1))).( ) We also devise a distributed deterministic algorithm in the CONG EST model that builds these emulators in low polynomial time (i.e., in O(n(rho)) time, for an arbitrarily small constant parameter time, for an arbitrarily small constant parameter rho > 0). Finally, we also improve the state-of-the-art distributed deterministic CONGEST-model construction of (1 + epsilon, beta)-spanners devised in the PODC'19 paper [13]. Specifically, the spanners of [13] have O(beta . n(1+1/kappa)) edges, i.e., at their sparsest they employ O(log log n/epsilon) (log log n). n edges. In this paper, we devise an efficient distributed deterministic CONGEST-model algorithm that builds such spanners with O(n(1+1/kappa)) edges for kappa = O (log n/log((3) )n). K = 0 At their sparsest, these spanners employ only O(n. log log n) edges.

关键词： Emulators Deterministic distributed Algorithms

来源：评论

学校读者我要写书评

暂无评论

Time-space trade-offs in population protocols for the majority problem

引用

distributed computing 2021年第2期34卷 91-111页

作者： Berenbrink, Petra Elsaesser, Robert Friedetzky, Tom Kaaser, Dominik Kling, Peter Radzik, Tomasz Univ Hamburg Vogt Kolln Str 3 D-22527 Hamburg Germany Univ Salzburg Jakob Haringer Str 2 A-5020 Salzburg Austria Univ Durham Lower Mountjoy South Rd Durham DH1 3LE England Kings Coll London Strand CampusBush House London WC2B 4BG England

Population protocols are a model for distributed computing that is focused on simplicity and robustness. A system ofnidentical agents (finite state machines) performs a global task like electing a unique leader or determining the majority opinion when each agent has one of two opinions. Agents communicate in pairwise interactions with randomly assigned communication partners. Quality is measured in two ways: the number of interactions to complete the task and the number of states per agent. We present protocols for the majority problem that allow for a trade-off between these two measures. Compared to the only other trade-off result (Alistarh et al. in proceedings of the 2015 acm symposium on principles of distributed computing, Donostia-San Sebastian, 2015), we improve the number of interactions by almost a linear factor. Furthermore, our protocols can be made uniform (working correctly without any information on the population sizen), yielding the first uniform majority protocols that stabilize in a subquadratic number of interactions.

关键词： distributed computing Majority Population protocols Stochastic processes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：