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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,315 篇 会议
152 篇 期刊文献
6 册 图书

馆藏范围

4,472 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

3,285 篇 工学
- 3,132 篇 计算机科学与技术...
- 1,644 篇 软件工程
- 413 篇 信息与通信工程
- 373 篇 电气工程
- 227 篇 控制科学与工程
- 82 篇 电子科学与技术（可...
- 53 篇 网络空间安全
- 48 篇 生物工程
- 35 篇 机械工程
- 30 篇 建筑学
- 24 篇 动力工程及工程热...
- 22 篇 生物医学工程（可授...
- 20 篇 化学工程与技术
- 19 篇 环境科学与工程（可...
- 18 篇 仪器科学与技术
- 18 篇 农业工程
- 16 篇 材料科学与工程（可...
807 篇 理学
- 672 篇 数学
- 129 篇 统计学（可授理学、...
- 65 篇 系统科学
- 52 篇 生物学
- 43 篇 物理学
- 26 篇 化学
376 篇 管理学
- 225 篇 管理科学与工程(可...
- 176 篇 图书情报与档案管...
- 170 篇 工商管理
120 篇 教育学
- 120 篇 教育学
46 篇 法学
- 37 篇 社会学
45 篇 经济学
- 44 篇 应用经济学
17 篇 农学
- 17 篇 作物学
16 篇 医学
1 篇 文学
1 篇 军事学

主题

372 篇 distributed comp...
262 篇 distributed comp...
134 篇 distributed algo...
106 篇 grid computing
99 篇 cloud computing
93 篇 distributed syst...
91 篇 computational mo...
62 篇 computer network...
61 篇 concurrent compu...
55 篇 computer science
53 篇 fault tolerance
50 篇 distributed algo...
50 篇 algorithms
49 篇 application soft...
46 篇 parallel computi...
44 篇 computer archite...
44 篇 distributed data...
43 篇 message passing
42 篇 computer systems...
42 篇 edge computing

机构

48 篇 swiss fed inst t...
32 篇 technion haifa
30 篇 universidade do ...
27 篇 carnegie mellon ...
24 篇 mit cambridge ma...
22 篇 univ freiburg fr...
17 篇 vienna universit...
16 篇 univ michigan an...
15 篇 university of au...
14 篇 tel aviv univ te...
14 篇 natl univ singap...
12 篇 univ toronto on
12 篇 georgia inst tec...
12 篇 uas technikum vi...
12 篇 ben gurion univ ...
12 篇 cornell univ ith...
12 篇 aalto univ espoo
12 篇 univ calif berke...
11 篇 ecole polytech f...
11 篇 indiana univ blo...

作者

33 篇 kuhn fabian
31 篇 ghaffari mohsen
24 篇 elkin michael
22 篇 awerbuch baruch
22 篇 chen haibo
22 篇 pandurangan gopa...
21 篇 suomela jukka
20 篇 censor-hillel ke...
19 篇 peleg david
19 篇 fraigniaud pierr...
18 篇 chang yi-jun
18 篇 wattenhofer roge...
18 篇 rui oliveira
17 篇 raynal michel
16 篇 rajsbaum sergio
16 篇 guerraoui rachid
16 篇 kutten shay
16 篇 brandt sebastian
15 篇 karl m. goeschka
15 篇 patt-shamir boaz

语言

4,425 篇 英文
44 篇 其他
4 篇 中文

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

共 4473 条记录，以下是351-360 订阅

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

详细简洁

排序：

Practical Efficient Microservice Autoscaling with QoS Assurance 22

Practical Efficient Microservice Autoscaling with QoS Assura...

引用

31st International symposium on High-Performance Parallel and distributed computing (HPDC)

作者： Hossen, Md Rajib Islam, Mohammad A. Ahmed, Kishwar Univ Texas Arlington Arlington TX 76019 USA Univ South Carolina Beaufort Bluffton SC USA

ISBN: (纸本)9781450391993

Cloud applications are increasingly moving away from monolithic services to agile microservices-based deployments. However, efficient resource management for microservices poses a significant hurdle due to the sheer number of loosely coupled and interacting components. The interdependencies between various microservices make existing cloud resource autoscaling techniques ineffective. Meanwhile, machine learning (ML) based approaches that try to capture the complex relationships in microservices require extensive training data and cause intentional SLO violations. Moreover, these ML-heavy approaches are slow in adapting to dynamically changing microservice operating environments. In this paper, we propose PEMA (Practical EfficientMicroservice Autoscaling), a lightweight microservice resource manager that finds efficient resource allocation through opportunistic resource reduction. PEMA's lightweight design enables novel workload-aware and adaptive resource management. Using three prototype microservice implementations, we show that PEMA can find efficient resource allocation and save up to 33% resource compared to the commercial rule-based resource allocations.

关键词： Autoscaling microservices resource management cloud computing quality of service

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

proceedings of the 40th acm/SIGAPP symposium on Applied computing

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

关键词： microservice

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal distributed Computation of Small Vertex Cuts 36

Near-Optimal Distributed Computation of Small Vertex Cuts

引用

36th International symposium on distributed computing, DISC 2022

作者： Parter, Merav Petruschka, Asaf Weizmann Institute Rehovot Israel

ISBN: (纸本)9783959772556

We present near-optimal algorithms for detecting small vertex cuts in the CONGEST model of distributed computing. Despite extensive research in this area, our understanding of the vertex connectivity of a graph is still incomplete, especially in the distributed setting. To this date, all distributed algorithms for detecting cut vertices suffer from an inherent dependency in the maximum degree of the graph, ∆. Hence, in particular, there is no truly sub-linear time algorithm for this problem, not even for detecting a single cut vertex. We take a new algorithmic approach for vertex connectivity which allows us to bypass the existing ∆ barrier. As a warm-up to our approach, we show a simple Õ(D)-round1 randomized algorithm for computing all cut vertices in a D-diameter n-vertex graph. This improves upon the O(D + ∆/log n)-round algorithm of [Pritchard and Thurimella, ICALP 2008]. Our key technical contribution is an Õ(D)-round randomized algorithm for computing all cut pairs in the graph, improving upon the state-of-the-art O(∆ · D)4-round algorithm by [Parter, DISC'19]. Note that even for the considerably simpler setting of edge cuts, currently Õ(D)-round algorithms are currently known only for detecting pairs of cut edges. Our approach is based on employing the well-known linear graph sketching technique [Ahn, Guha and McGregor, SODA 2012] along with the heavy-light tree decomposition of [Sleator and Tarjan, STOC 1981]. Combining this with a careful characterization of the survivable subgraphs, allows us to determine the connectivity of G \ {x, y} for every pair x, y ∈ V, using Õ(D)-rounds. We believe that the tools provided in this paper are useful for omitting the ∆-dependency even for larger cut values. © Merav Parter and Asaf Petruschka.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

The Topology of Randomized Symmetry-Breaking distributed computing 21

The Topology of Randomized Symmetry-Breaking Distributed Com...

引用

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

作者： Fraigniaud, Pierre Gelles, Ran Lotker, Zvi Univ Paris Paris France CNRS Paris France Bar Ilan Univ Ramat Gan Israel

ISBN: (纸本)9781450385480

Studying distributed computing through the lens of algebraic topology has been the source of many significant breakthroughs during the last two decades, especially in the design of lower bounds or impossibility results for deterministic algorithms. In a nutshell, this approach consists of capturing all the possible states of a distributed system at a certain time as a simplicial complex called protocol complex, and viewing computation as a simplicial map from that complex to the so-called output complex, that captures all possible legal output states of the system. This paper aims at studying randomized synchronous distributed computing through the lens of algebraic topology. We do so by studying the wide class of (input-free) symmetry-breaking tasks, e.g., leader election, in synchronous fault-free anonymous systems. We show that it is possible to redefine solvability of a task "locally", i.e., for each simplex of the protocol complex individually, without requiring any global consistency. However, this approach has a drawback: it eliminates the topological aspect of the computation, since a single facet has a trivial topological structure. To overcome this issue, we introduce a "projection" pi of both protocol and output complexes, where every simplex.. is mapped to a complex pi (sigma);the later has a rich structure that replaces the structure we lost by considering one single facet at a time. To show the significance and applicability of our topological approach, we derive necessary and sufficient conditions for solving leader election in synchronous fault-free anonymous sharedmemory and message-passing models. In both models, we consider scenarios in which there might be correlations between the random values provided to the nodes. In particular, different parties might have access to the same randomness source so their randomness is not independent but equal. Interestingly, we find that solvability of leader election relates to the number of parties that posse

关键词： distributed computing lower bounds algebraic topology correlated randomness leader election

来源：评论

学校读者我要写书评

暂无评论

proceedings of the 2022 acm SIGSIM International Conference on principles of Advanced Discrete Simulation, acm SIGSIM PADS 2022

Proceedings of the 2022 ACM SIGSIM International Conference ...

引用

2022 acm SIGSIM International Conference on principles of Advanced Discrete Simulation, SIGSIM PADS 2022

ISBN: (纸本)9781450392617

The proceedings contain 25 papers. The topics discussed include: temporally synchronized emulation of devices with simulation of networks;adaptive partitioning for distributed multi-agent simulations;addressing white-box modeling and simulation challenges in parallel computing;explainable artificial intelligence: requirements for explainability;data assimilation of opinion dynamics based on particle filter;towards an open repository for reproducible performance comparison of parallel and distributed discrete-event simulators;a data-driven approach for pedestrian intention prediction in large public places;integrating I/O time to virtual time system for high fidelity container-based network emulation;effective simulation of on-demand services;simulation of entanglement generation and distribution - towards practical quantum networks;and formal methods for modeling and simulation of emergent behavior in complex adaptive systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Boosting Performance and QoS for Concurrent GPU B+trees by Combining-Based Synchronization 23

Boosting Performance and QoS for Concurrent GPU B+trees by C...

引用

28th acm SIGPLAN Annual symposium on principles and Practice of Parallel Programming, PPoPP 2023

作者： Zhang, Weihua Zhao, Chuanlei Peng, Lu Lin, Yuzhe Zhang, Fengzhe Lu, Yunping School of Computer Science Fudan University China Institute of Big Data Fudan University China State Key Laboratory of Mathematical Engineering and Advanced Computing China Parallel Processing Institute Fudan University China Department of Computer Science Tulane University United States

ISBN: (纸本)9798400700156

Concurrent B+trees have been widely used in many systems. With the scale of data requests increasing exponentially, the systems are facing tremendous performance pressure. GPU has shown its potential to accelerate concurrent B+trees performance. When many concurrent requests are processed, the conflicts should be detected and resolved. Prior methods guarantee the correctness of concurrent GPU B+trees through lock-based or software transactional memory (STM)-based approaches. However, these methods complicate the request processing logic, increase the number of memory accesses and bring execution path divergence. They lead to performance degradation and variance in response time increasing. Moreover, previous methods do not guarantee linearizability among concurrent requests. In this paper, we design a combined-based concurrency control framework, called Eirene, for GPU B+tree to reduce the overhead of conflict detection and resolution. First, a combining-based synchronization method is designed to combine and issue requests. It combines the requests with the same key, constructs their dependence, decides the issued request, and determines their return values. Since only one request for each key is issued, key conflicts are eliminated. Then, an optimistic STM method is used to reduce structure conflicts. The query and the update requests are partitioned into different kernels. For the update kernels, STM is involved only when the number of the retry reaches a threshold. Finally, a locality-aware warp reorganization optimization is proposed to improve memory behavior and reduce conflicts by exploiting the locality among requests. Evaluations on an NVIDIA A100 GPU show that Eirene is efficient (a throughput of 2.4 billion per second) and can guarantee linearizability. Compared to the state-of-the-art GPU B+tree, it can achieve a speedup of 7.43X and reduce the response time variance from 36% to 5%. © 2023 acm.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Characterizing and Orchestrating VM Reservation in Geo-distributed Clouds to Improve the Resource Efficiency 13

Characterizing and Orchestrating VM Reservation in Geo-distr...

引用

13th Annual acm symposium on Cloud computing (SoCC)

作者： Shi, Jiuchen Fu, Kaihua Chen, Quan Yang, Changpeng Huang, Pengfei Zhou, Mosong Zhao, Jieru Chen, Chen Guo, Minyi Shanghai Jiao Tong Univ Shanghai Peoples R China Huawei Cloud Dublin Ireland

ISBN: (纸本)9781450394147

Cloud providers often build a geo-distributed cloud from multiple datacenters in different geographic regions, to serve tenants at different locations. The tenants that run large scale applications often reserve resources based on their peak loads in the region close to the end users to handle the ever changing application load, wasting a large amount of resources. We therefore characterize the VM request patterns of the top tenants in our production public geo-distributed cloud, and open-source the VM request traces in four months from the top 20 tenants of our cloud. The characterization shows that the resource usage of large tenants has various temporal and spatial patterns on the dimensions of time series, regions, and VM types, and has the potential of peak shaving between different tenants to further reduce the resource reservation cost. Based on the findings, we propose a resource reservation and VM request scheduling scheme named ROS to minimize the resource reservation cost while satisfying the VM allocation requests. Our experiments show that ROS reduces the overall deployment cost by 75.4% and the reservation resources by 60.1%, compared to the tenant-specified reservation strategy.

关键词： Geo-distributed cloud Resource reservation Trace analysis

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Temporal Locality in Online Algorithms 36

Brief Announcement: Temporal Locality in Online Algorithms

引用

36th International symposium on distributed computing, DISC 2022

作者： Pacut, Maciej Parham, Mahmoud Rybicki, Joel Schmid, Stefan Suomela, Jukka Tereshchenko, Aleksandr Technische Universität Berlin Germany Faculty of Computer Science Universität Wien Austria Institute of Science and Technology Austria Klosterneuburg Austria TU Berlin Germany Fraunhofer SIT Berlin Germany Aalto University Espoo Finland

ISBN: (纸本)9783959772556

Online algorithms make decisions based on past inputs, with the goal of being competitive against an algorithm that sees also future inputs. In this work, we introduce time-local online algorithms;these are online algorithms in which the output at any given time is a function of only T latest inputs. Our main observation is that time-local online algorithms are closely connected to local distributed graph algorithms: distributed algorithms make decisions based on the local information in the spatial dimension, while time-local online algorithms make decisions based on the local information in the temporal dimension. We formalize this connection, and show how we can directly use the tools developed to study distributed approximability of graph optimization problems to prove upper and lower bounds on the competitive ratio achieved with time-local online algorithms. Moreover, we show how to use computational techniques to synthesize optimal time-local algorithms. © Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, and Aleksandr Tereshchenko.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed Download from an External Data Source in Byzantine Majority Settings 25

Brief Announcement: Distributed Download from an External Da...

引用

proceedings of the acm symposium on principles of distributed computing

作者： John Augustine Soumyottam Chatterjee Valerie King Manish Kumar Shachar Meir David Peleg Indian Institute of Technology Madras Chennai Tamil Nadu India University of Victoria Victoria British Columbia Canada The Weizmann institute of science Rehovot Israel The Weizmann Institute of Science Rehovot Israel

ISBN: (纸本)9798400718854

We consider the Download problem in the Data Retrieval Model, introduced in (DISC'24), where a distributed set of peers, some of which may be Byzantine, seek to learn n bits of data stored at a trustworthy external data source. Each bit of data can be learned by a peer either through a direct (costly) query of the source or through other peers that have already learned it; the goal is to design a collaborative protocol that reduces the maximum number of bits queried by any one peer ("query complexity"). We achieve optimal query complexity in a synchronous fully connected network with resilience to any constant fraction β < 1 of Byzantine peers, under varying assumptions regarding time and message size.A full version of the paper is available at [2].

关键词： byzantine fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Locally Checkable Problems in Rooted Trees 21

Locally Checkable Problems in Rooted Trees

引用

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

作者： Balliu, Alkida Brandt, Sebastian Olivetti, Dennis Studeny, Jan Suomela, Jukka Tereshchenko, Aleksandr Univ Freiburg Freiburg Germany Swiss Fed Inst Technol Zurich Switzerland Aalto Univ Espoo Finland

ISBN: (纸本)9781450385480

Consider any locally checkable labeling problem Pi in rooted regular trees: there is a finite set of labels Sigma, and for each label x is an element of Sigma we specify what are permitted label combinations of the children for an internal node of label x (the leaf nodes are unconstrained). This formalism is expressive enough to capture many classic problems studied in distributed computing, including vertex coloring, edge coloring, and maximal independent set. We show that the distributed computational complexity of any such problem Pi falls in one of the following classes: it is O(1), Theta(log* n), Theta(log n), or n(Theta)(1) rounds in trees with n nodes (and all of these classes are nonempty). We show that the complexity of any given problem is the same in all four standard models of distributed graph algorithms: deterministic LOCAL, randomized LOCAL, deterministic CONGEST, and randomized CONGEST model. In particular, we show that randomness does not help in this setting, and the complexity class Theta(log log n) does not exist (while it does exist in the broader setting of general trees). We also show how to systematically determine the complexity class of any such problem Pi, i.e., whether II takes Theta(1), Theta(log* n), Theta(log n), or n(Theta(1)) rounds. While the algorithm may take exponential time in the size of the description of II, it is nevertheless practical: we provide a freely available implementation of the classifier algorithm, and it is fast enough to classify many problems of interest.

关键词： distributed algorithms LOCAL model CONGEST model Rooted trees LCL problems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 32 33 34 35 36 37 38 39 40 41 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：