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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,338 篇 会议
54 篇 期刊文献
1 册 图书

馆藏范围

1,393 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,075 篇 工学
- 1,034 篇 计算机科学与技术...
- 459 篇 软件工程
- 158 篇 信息与通信工程
- 146 篇 电气工程
- 78 篇 控制科学与工程
- 42 篇 网络空间安全
- 16 篇 电子科学与技术（可...
- 8 篇 化学工程与技术
- 8 篇 农业工程
- 6 篇 仪器科学与技术
- 6 篇 建筑学
- 6 篇 生物工程
- 5 篇 机械工程
- 5 篇 生物医学工程（可授...
- 4 篇 光学工程
- 4 篇 材料科学与工程（可...
297 篇 理学
- 270 篇 数学
- 70 篇 统计学（可授理学、...
- 17 篇 物理学
- 10 篇 系统科学
- 9 篇 化学
- 8 篇 生物学
- 6 篇 大气科学
65 篇 管理学
- 34 篇 图书情报与档案管...
- 33 篇 管理科学与工程(可...
- 23 篇 工商管理
15 篇 教育学
- 15 篇 教育学
13 篇 经济学
- 13 篇 应用经济学
9 篇 法学
- 7 篇 社会学
8 篇 农学
- 8 篇 作物学
1 篇 医学

主题

249 篇 distributed comp...
96 篇 distributed algo...
77 篇 distributed comp...
34 篇 distributed algo...
29 篇 consensus
25 篇 distributed syst...
24 篇 congest model
23 篇 approximation al...
23 篇 computer systems...
23 篇 local model
22 篇 algorithms
21 篇 distributed grap...
20 篇 fault tolerance
19 篇 cloud computing
17 篇 shared memory
16 篇 self-stabilizati...
15 篇 message passing
15 篇 fault-tolerance
14 篇 lower bounds
13 篇 graph algorithms

机构

26 篇 swiss fed inst t...
24 篇 technion haifa
17 篇 mit cambridge ma...
16 篇 univ freiburg fr...
11 篇 tel aviv univ te...
10 篇 univ michigan an...
10 篇 carnegie mellon ...
10 篇 technion dept co...
10 篇 aalto univ espoo
10 篇 natl univ singap...
9 篇 ben gurion univ ...
8 篇 weizmann inst sc...
8 篇 cispa helmholtz ...
8 篇 national univers...
7 篇 ben gurion univ ...
6 篇 ecole polytech f...
6 篇 cnrs
6 篇 univ texas austi...
5 篇 georgetown univ ...
5 篇 aalto university...

作者

24 篇 kuhn fabian
20 篇 ghaffari mohsen
18 篇 suomela jukka
18 篇 censor-hillel ke...
17 篇 raynal michel
17 篇 fraigniaud pierr...
16 篇 elkin michael
15 篇 chang yi-jun
15 篇 pandurangan gopa...
15 篇 brandt sebastian
14 篇 peleg david
14 篇 toueg sam
14 篇 olivetti dennis
14 篇 wattenhofer roge...
14 篇 kutten shay
13 篇 balliu alkida
13 篇 patt-shamir boaz
13 篇 guerraoui rachid
12 篇 rajsbaum sergio
12 篇 maus yannic

语言

1,379 篇 英文
13 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing"

共 1393 条记录，以下是161-170 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Brief Announcement: Strong and Hiding distributed Certification of $k$-Coloring 25

Brief Announcement: Strong and Hiding Distributed Certificat...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Augusto Modanese Pedro Montealegre Martín Ríos-Wilson Aalto University Espoo Finland Adolfo Ibáñez University Santiago Chile

ISBN: (纸本)9798400718854

We study the problem of certifying whether a graph is k-colorable with a locally checkable proof (LCP) that is able to hide the k-coloring from the verifier, in the sense that no algorithm can (completely) extract a k-coloring from the certificate. Motivated by the search for promise-free separations of extensions of the LOCAL model in the context of locally checkable labeling (LCL) problems, we also require the LCPs to satisfy what we call the strong soundness property. We focus on the case of 2-coloring and show that strong and hiding LCPs for 2-coloring exist in specific graph classes and require only O (log n)-sized certificates. Furthermore, when the input is promised to be a cycle or contains a node of degree 1, we show the existence of strong and hiding LCPs even in an anonymous network and with constant-size certificates. Despite these upper bounds, we prove that there are no strong and hiding LCPs for 2-coloring in general, regardless of certificate size. Along the way, we give a characterization of the hiding property for the general k-coloring problem that appears to be a key component for future investigations in this context.

关键词： coloring problem

来源：评论

学校读者我要写书评

暂无评论

On Register Linearizability and Termination 21

On Register Linearizability and Termination

引用

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

作者： Hadzilacos, Vassos Hu, Xing Toueg, Sam Univ Toronto Toronto ON Canada

ISBN: (纸本)9781450385480

It is well-known that, for deterministic algorithms, linearizable objects can be used as if they were atomic objects. As pointed out by Golab, Higham, and Woelfel, however, a randomized algorithm that works with atomic objects may lose some of its properties if we replace the atomic objects that it uses with objects that are only linearizable. It was not known whether the properties that can be lost include the all-important property of termination (with probability 1). In this paper, we first show that a randomized algorithm can indeed lose its termination property if we replace the atomic registers that it uses with linearizable ones. Golab et al. also introduced strong linearizability, and proved that strongly linearizable objects can be used as if they were atomic objects, even for randomized algorithms: they can replace atomic objects while preserving the algorithm's correctness properties, including termination. Unfortunately, there are important cases where strong linearizability is impossible to achieve. In particular, Helmi, Higham, and Woelfel showed a large class of "non-trivial" objects, including MWMR registers, do not have strongly linearizable implementations from SWMR registers. Thus we propose a new type of register linearizability, called write strong-linearizability, that is strictly stronger than (plain) linearizability but strictly weaker than strong linearizability. This intermediate type of linearizability has some desirable properties. We prove that some randomized algorithms that fail to terminate with linearizable registers, work with write strongly-linearizable ones. In other words, there are cases where linearizability is not sufficient but write strong-linearizability is. In contrast to the impossibility result mentioned above, we prove that write strongly-linearizable MWMR registers are implementable from SWMR registers. While the well-known ABD implementation of SWMR registers in message-passing system is not strongly linearizable, we

关键词： distributed computing concurrency linearizability shared registers

来源：评论

学校读者我要写书评

暂无评论

Message Optimality and Message-Time Trade-offs for APSP and Beyond 25

Message Optimality and Message-Time Trade-offs for APSP and ...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Fabien Dufoulon Shreyas Pai Gopal Pandurangan Sriram Pemmaraju Peter Robinson School of Computing and Communications Lancaster University Lancaster United Kingdom IIT Madras Chennai India Department of Computer Science University of Houston Houston Texas USA University of Iowa Iowa City Iowa USA Augusta University Augusta Georgia USA

ISBN: (纸本)9798400718854

Round complexity is an extensively studied metric of distributed algorithms. In contrast, our knowledge of the message complexity of distributed computing problems and its relationship (if any) with round complexity is still quite limited. To illustrate, for many fundamental distributed graph optimization problems such as (exact) diameter computation, All-Pairs Shortest Paths (APSP), Maximum Matching etc., while (near) round-optimal algorithms are known, message-optimal algorithms are hitherto unknown. More importantly, the existing round-optimal algorithms are not message-optimal. This raises two important questions: (1) Can we design message-optimal algorithms for these problems? (2) Can we give message-time tradeoffs for these problems in case the message-optimal algorithms are not round-optimal?In this work, we focus on a fundamental graph optimization problem, All Pairs Shortest Path (APSP), whose message complexity is still unresolved. We present two main results:(1) An algorithm that solves weighted APSP, using Õ(n2) messages in Õ(n2) rounds. This algorithm is message-optimal (up to logarithmic factors) for algorithms that take poly(n) rounds.(2) For any 0 ≤ ϵ ≤ 1, we show how to solve unweighted APSP in Õ(n2–ϵ) rounds and Õ(n2+ϵ) messages. At one end of this smooth trade-off, we obtain a (nearly) message-optimal algorithm (for algorithms that take poly(n) rounds) using Õ(n2) messages (for ϵ = 0), whereas at the other end we get a (nearly) round-optimal algorithm using Õ(n) rounds (for ϵ = 1).

关键词： distributed APSP

来源：评论

学校读者我要写书评

暂无评论

Understanding and Detecting Software Upgrade Failures in distributed Systems 21

Understanding and Detecting Software Upgrade Failures in Dis...

引用

28th acm symposium on Operating Systems principles (SOSP)

作者： Zhang, Yongle Yang, Junwen Jin, Zhuqi Sethi, Utsav Rodrigues, Kirk Lu, Shan Yuan, Ding Purdue Univ W Lafayette IN 47907 USA Univ Chicago Chicago IL 60637 USA Univ Toronto Toronto ON Canada

ISBN: (纸本)9781450387095

Upgrade is one of the most disruptive yet unavoidable maintenance tasks that undermine the availability of distributed systems. Any failure during an upgrade is catastrophic, as it further extends the service disruption caused by the upgrade. The increasing adoption of continuous deployment further increases the frequency and burden of the upgrade task. In practice, upgrade failures have caused many of today's high-profile cloud outages. Unfortunately, there has been little understanding of their characteristics. This paper presents an in-depth study of 123 real-world upgrade failures that were previously reported by users in 8 widely used distributed systems, shedding lights on the severity, root causes, exposing conditions, and fix strategies of upgrade failures. Guided by our study, we have designed a testing framework DUPTester that revealed 20 previously unknown upgrade failures in 4 distributed systems, and applied a series of static checkers DUPChecker that discovered over 800 cross-version data-format incompatibilities that can lead to upgrade failures. DUPChecker has been requested by HBase developers to be integrated into their toolchain.

关键词： upgrade failure distributed systems study bug detection

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Foraging in Particle Systems via Self-Induced Phase Changes 36

Brief Announcement: Foraging in Particle Systems via Self-In...

引用

36th International symposium on distributed computing, DISC 2022

作者： Oh, Shunhao Randall, Dana Richa, Andréa W. School of Computer Science Georgia Institute of Technology AtlantaGA United States School of Computing and Augmented Intelligence Arizona State University TempeAZ United States

ISBN: (纸本)9783959772556

The foraging problem asks how a collective of particles with limited computational, communication and movement capabilities can autonomously compress around a food source and disperse when the food is depleted or shifted, which may occur at arbitrary times. We would like the particles to iteratively self-organize, using only local interactions, to correctly gather whenever a food particle remains in a position long enough and search if no food particle has existed recently. Unlike previous approaches, these search and gather phases should be self-induced so as to be indefinitely repeatable as the food evolves, with microscopic changes to the food triggering macroscopic, system-wide phase transitions. We present a stochastic foraging algorithm based on a phase change in the fixed magnetization Ising model from statistical physics: Our algorithm is the first to leverage self-induced phase changes as an algorithmic tool. A key component of our algorithm is a careful token passing mechanism ensuring a dispersion broadcast wave will always outpace a compression wave. © Shunhao Oh, Dana Randall, and Andréa W. Richa.

关键词： Ising model

来源：评论

学校读者我要写书评

暂无评论

A tight meta-theorem for LOCAL certification of MSO2 properties within bounded treewidth graphs 25

A tight meta-theorem for LOCAL certification of MSO2 propert...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Linda Cook Eun Jung Kim Tomáš Masařík Korteweg-de Vries Institute of Mathematics University of Amsterdam Amsterdam Netherlands School of Computing KAIST and Discrete Mathematics Group Institute for Basic Science (IBS) Daejeon Republic of Korea CNRS Paris France Institute of Informatics Faculty of Mathematics Informatics and Mechanics University of Warsaw Warsaw Poland

ISBN: (纸本)9798400718854

distributed networks are prone to errors so verifying their output is critical. We develop local certification protocols for graph properties in which nodes are given certificates that allow them to check whether the network as a whole satisfies some fixed property while only communicating with their local network. Instead of considering a specific problem and developing a local certification protocol tailor-made for the problem, we aim for generic protocols that can certify any property expressible in a certain logical *** consider Monadic Second Order Logic (MSO2), a powerful framework that can express properties such as non-k-colorability, Hamiltonicity, and H-minor-freeness. Unfortunately, in general, there are MSO2-expressible properties that cannot be certified without huge certificates. For instance, non-3-colorability requires certificates of size Ω(n2/log n) on general n-vertex graphs (Göös, Suomela 2016). Hence, we impose additional structural restrictions on the graph. Inspired by their importance in centralized computing and Robertson-Seymour Graph Minor theory, we consider graphs of bounded *** provide a local certification protocol for certifying any MSO2-expressible property on graphs of bounded treewidth and, consequently, a local certification protocol for certifying bounded treewidth. That is, for each integer k and each MSO2-expressible property Π, we give a local certification protocol to certify that a graph satisfies Π and has treewidth at most k using certificates of size O(log n) (which is asymptotically optimal). Our local certification protocol requires only one-round of distributed communication, hence it is a proof-labeling *** result improves upon the works of Fraigniaud, Montealegre, Rapaport, and Todinca (Algorithmica 2024), Bousquet, Feuilloley, Pierron (PODC 2022), and the very recent work of Baterisna and Chang.

关键词： LOCAL certification

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Towards Optimal distributed Delta Coloring 25

Brief Announcement: Towards Optimal Distributed Delta Colori...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Manuel Jakob Yannic Maus TU Graz Graz Austria

ISBN: (纸本)9798400718854

The Δ-vertex coloring problem has become one of the prototypical problems for understanding the complexity of local distributed graph problems on constant-degree graphs. The major open problem is whether the problem can be solved deterministically in logarithmic time, which would match the lower bound [Chang et al., FOCS'16]. Despite recent progress in the design of efficient Δ-coloring algorithms, there is currently a polynomial gap between the upper and lower *** this work we present a O (log n)-round deterministic Δ-coloring algorithm for dense constant-degree graphs, matching the lower bound for the problem on general graphs. For general Δ the algorithms' complexity is min{Õ(log5/3 n), O (Δ + log n)}. All recent distributed and sublinear graph coloring algorithms (also for coloring with more than Δ colors) decompose the graph into sparse and dense parts. Our algorithm works for the case that this decomposition has no sparse vertices. Ironically, in recent (randomized) Δ-coloring algorithms, dealing with sparse parts was relatively easy and these dense parts arguably posed the major hurdle. We present a solution that addresses the dense parts and may have the potential for extension to sparse *** approach is fundamentally different from prior deterministic algorithms and hence hopefully contributes towards designing an optimal algorithm for the general case. Additionally, we leverage our result to also obtain a randomized min{Õ(log5/3 log n), O (Δ + log log n)}-round algorithm for Δ-coloring dense graphs that also matches the lower bound for the problem on general constant-degree graphs [Brandt et al.; STOC'16].

关键词： distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

PreMatch: A Prediction-based Scheduler for Dataflow Asynchronous Processing on the computing Continuum 25

PreMatch: A Prediction-based Scheduler for Dataflow Asynchro...

引用

40th Annual acm symposium on Applied computing, SAC 2025

作者： Mehran, Narges Najafabadi Samani, Zahra Afzal, Samira Prodan, Radu Pallas, Frank Dorfinger, Peter Faculty of Digital and Analytical Sciences Paris Lodron University of Salzburg Salzburg Austria Intelligent Connectivity Group Salzburg Research Forschungsgesellschaft MbH Salzburg Austria Distributed and Parallel Systems Group University of Innsbruck Tyrol Innsbruck Austria Faculty of Electrical Engineering Mathematics and Computer Science University of Twente Overijssel Enschede Netherlands Institute of Information Technology Alpen-Adria-University of Klagenfurt Carinthia Klagenfurt Austria

ISBN: (纸本)9798400706295

The popularity of asynchronous data exchange patterns has recently increased, as evidenced by 23% of the communication between microservices in an Alibaba trace analysis. Such workloads necessitate methods for reducing dataflow processing and completion time by forecasting the future requirements of their microservices and (re-)scheduling them. Therefore, we investigate a prediction-based scheduling method of asynchronous dataflow processing applications by considering the stochastic changes due to dynamic user requirements. We present a microservice scaling and scheduling method named PreMatch combining a machine learning (ML) prediction strategy based on gradient boosting with ranking and game theory matching scheduling principles. Firstly, PreMatch predicts the number of microservice replicas, and then, the ranking method orders the microservice replicas and devices based on microservice and transmission times. Thereafter, the PreMatch schedules microservice replicas requiring dataflow processing on computing devices. Experimental analysis of the PreMatch method shows lower completion times on average 13% compared to a related prediction-based scheduling method. Copyright © 2025 held by the owner/author(s).

关键词： Data curation

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Revisiting Lower Bounds for Two-Step Consensus 25

Brief Announcement: Revisiting Lower Bounds for Two-Step Con...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Fedor Ryabinin Alexey Gotsman Pierre Sutra IMDEA Software Institute Madrid Spain Universidad Politécnica de Madrid Madrid Spain Télécom SudParis Palaiseau France Inria Saclay Palaiseau France Institut Polytechnique de Paris Palaiseau France

ISBN: (纸本)9798400718854

A seminal result by Lamport shows that at least max{2e + f + 1, 2f + 1} processes are required to implement partially synchronous consensus that tolerates f process failures and can furthermore decide in two message delays under f failures. This lower bound is matched by the classical Fast Paxos protocol. However, more recent practical protocols, such as Egalitarian Paxos, provide two-step decisions with fewer processes, seemingly contradicting the lower bound. We show that this discrepancy arises because the classical bound requires two-step decisions under a wide range of scenarios, not all of which are relevant in practice. We propose a more pragmatic condition for which we establish tight bounds on the number of processes required. Interestingly, these bounds depend on whether consensus is implemented as an atomic object or a decision task. For consensus as an object, max{2e + f - 1, 2f + 1} processes are necessary and sufficient for two-step decisions, while for a task the tight bound is max{2e + f, 2f + 1}.

关键词： distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching in Radio Networks 21

Brief Announcement: Wake Up and Join Me! An Energy-Efficient...

引用

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

作者： Dani, Varsha Gupta, Aayush Hayes, Thomas P. Pettie, Seth Ronin Inst Montclair NJ 07043 USA Univ New Mexico Dept Comp Sci Albuquerque NM 87131 USA Univ Michigan Dept EECS Ann Arbor MI 48109 USA

ISBN: (纸本)9781450385480

We consider networks of small, autonomous devices that communicate with each other wirelessly. Minimizing energy usage is an important consideration in designing algorithms for such networks, as battery life is a crucial and limited resource. Working in a model where both sending and listening for messages deplete energy, we consider the problem of finding a maximal matching of the nodes in a radio network of arbitrary and unknown topology. We present a distributed randomized algorithm that produces, with high probability, a maximal matching. The maximum energy cost per node is O(log(2) n), and the time complexity is O(Delta log(n)). Here n is any upper bound on the number of nodes, and Delta is any upper bound on the maximum degree;n and Delta are parameters of our algorithm that we assume are known a priori to all the processors. We note that there exist families of graphs for which our bounds on energy cost and time complexity are simultaneously optimal up to polylog factors, so any significant improvement would need additional assumptions about the network topology. We also consider the related problem of assigning, for each node in the network, a neighbor to back up its data in case of eventual node failure. Here, a key goal is to minimize the maximum load, defined as the number of nodes assigned to a single node. We present an efficient decentralized low-energy algorithm that finds a neighbor assignment whose maximum load is at most a polylog(n) factor bigger that the optimum.

关键词： distributed Algorithms Energy-Aware Computation Radio Networks Maximal Matching Sensor Networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共140页 << < 13 14 15 16 17 18 19 20 21 22 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：