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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,269 篇 会议
85 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

888 篇 工学
- 822 篇 计算机科学与技术...
- 596 篇 软件工程
- 256 篇 信息与通信工程
- 147 篇 控制科学与工程
- 132 篇 电气工程
- 64 篇 电子科学与技术（可...
- 58 篇 网络空间安全
- 31 篇 动力工程及工程热...
- 29 篇 机械工程
- 24 篇 材料科学与工程（可...
- 21 篇 仪器科学与技术
- 18 篇 生物工程
- 10 篇 建筑学
- 9 篇 力学（可授工学、理...
- 9 篇 光学工程
- 9 篇 化学工程与技术
- 8 篇 交通运输工程
- 7 篇 土木工程
- 7 篇 环境科学与工程（可...
422 篇 理学
- 366 篇 数学
- 182 篇 统计学（可授理学、...
- 38 篇 系统科学
- 24 篇 物理学
- 20 篇 生物学
- 15 篇 化学
187 篇 管理学
- 161 篇 管理科学与工程(可...
- 105 篇 工商管理
- 36 篇 图书情报与档案管...
25 篇 法学
- 24 篇 社会学
24 篇 经济学
- 24 篇 应用经济学
6 篇 农学
5 篇 教育学
3 篇 医学
2 篇 军事学

主题

69 篇 computer simulat...
67 篇 computational mo...
66 篇 computer network...
52 篇 computer systems...
33 篇 measurement
28 篇 analytical model...
26 篇 computer archite...
23 篇 computer science
23 篇 wireless sensor ...
23 篇 computer operati...
21 篇 discrete event s...
21 篇 distributed comp...
17 篇 queueing network...
17 篇 scheduling
17 篇 computer systems
16 篇 telecommunicatio...
15 篇 client server co...
14 篇 costs
14 篇 time measurement
14 篇 response time (c...

机构

8 篇 department of co...
8 篇 department of co...
7 篇 department of co...
5 篇 department of co...
5 篇 department of co...
4 篇 univ of washingt...
4 篇 univ of californ...
4 篇 department of co...
4 篇 carnegie mellon ...
4 篇 computer systems...
4 篇 computer systems...
4 篇 dept. of comp. s...
4 篇 department of co...
4 篇 department of co...
4 篇 computer science...
4 篇 department of co...
4 篇 computer science...
4 篇 department of co...
3 篇 school of comput...
3 篇 univ of californ...

作者

19 篇 towsley don
9 篇 lazowska edward ...
8 篇 liu alex x.
8 篇 vernon mary k.
8 篇 zahorjan john
8 篇 tripathi satish ...
7 篇 stankovic john a...
7 篇 estrin deborah
7 篇 crovella mark
7 篇 shenoy prashant
7 篇 wang jia
6 篇 don towsley
6 篇 dowdy lawrence w...
6 篇 wood david a.
6 篇 van houdt benny
6 篇 harchol-balter m...
5 篇 pai vivek s.
5 篇 feamster nick
5 篇 martonosi margar...
5 篇 zhang zhi-li

语言

1,327 篇 英文
27 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the 1994 ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems"

共 1355 条记录，以下是81-90 订阅

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

详细简洁

排序：

proceedings of PMBS 2020: Performance modeling, Benchmarking and Simulation of High Performance computer systems, Held in conjunction with SC 2020: The International conference for High Performance Computing, Networking, Storage and Analysis

Proceedings of PMBS 2020: Performance Modeling, Benchmarking...

引用

2020 IEEE/acm Performance modeling, Benchmarking and Simulation of High Performance computer systems, PMBS 2020

ISBN: (纸本)9781665422659

The proceedings contain 12 papers. The topics discussed include: lightweight measurement and analysis of HPC performance variability;performance modeling of streaming kernels and sparse matrix-vector multiplication on A64FX;evaluating the performance of NVIDIA's A100 ampere GPU for sparse and batched computations;developing models for the runtime of programs with exponential runtime behavior;evaluation of the communication motif for a distributed eigensolver using the SST network simulation tool;accelerating high-order stencils on GPUs;the performance and energy efficiency potential of FPGAs in scientific computing;and performance trade-offs in GPU communication: a study of host and device-initiated approaches.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Inferring catchment in internet routing 19

Inferring catchment in internet routing

引用

14th Joint conference of International conference on measurement and modeling of computer systems, sigmetrics 2019 and IFIP Performance conference 2019, sigmetrics/Performance 2019

作者： Sermpezis, Pavlos Kotronis, Vasileios Institute of Computer Science FORTH Heraklion Greece

ISBN: (纸本)9781450366786

BGP is the de-facto Internet routing protocol for interconnecting Autonomous systems (AS). Each AS selects its preferred routes based on its routing policies, which are typically not disclosed. Due to the distributed route selection and information hiding, answering questions such as "what is the expected catchment of the anycast sites of a content provider at the AS-level, if new sites are deployed?", or "how will load-balancing behave if an ISP changes its routing policy for a prefix?", is a hard challenge. In this work, we propose a framework and methodology to infer the routing behavior in existing or hypothetical routing configurations, and provide new capabilities and insights for informative route inference (e.g., isolating the effect of randomness that is present in prior simulation-based approaches). The proposed framework can be useful in a number of applications: measurements/monitoring, traffic engineering, network planning, Internet routing models, etc. © 2019 Copyright held by the owner/author(s).

关键词： Border Gateway Protocol

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of workload dependent load balancing policies 19

Performance analysis of workload dependent load balancing po...

引用

14th Joint conference of International conference on measurement and modeling of computer systems, sigmetrics 2019 and IFIP Performance conference 2019, sigmetrics/Performance 2019

作者： Hellemans, Tim Bodas, Tejas Van Houdt, Benny University of Antwerp Antwerp Belgium

ISBN: (纸本)9781450366786

Load balancing plays a crucial role in achieving low latency in large distributed systems. Recent load balancing strategies often rely on replication or use placeholders to further improve latency. However assessing the performance and stability of these strategies is challenging and is therefore often simulation based. In this paper we introduce a unified approach to analyze the performance and stability of a broad class of workload dependent load balancing strategies. This class includes many replication policies, such as replicate below threshold, delayed replication and replicate only small jobs, as well as strategies for fork-join *** consider systems with general job size distributions where jobs may experience server slowdown. We show that the equilibrium workload distribution of the cavity process satisfies a functional differential equation and conjecture that the cavity process captures the limiting behavior of the system as its size tends to *** study this functional differential equation in more detail for a variety of load balancing policies and propose a numerical method to solve it. The numerical method relies on a fixed point iteration or a simple Euler iteration depending on the type of functional differential equation involved. We further show that additional simplifications can be made if certain distributions are assumed to be *** numerical examples are included that validate the numerical method and illustrate its strength and flexibility.

关键词： fixed point equation differential equation large scale computer network load balancing redundancy workload

来源：评论

学校读者我要写书评

暂无评论

Analysis of a canonical labeling algorithm for the alignment of correlated Erdos-Rényi graphs 19

Analysis of a canonical labeling algorithm for the alignment...

引用

14th Joint conference of International conference on measurement and modeling of computer systems, sigmetrics 2019 and IFIP Performance conference 2019, sigmetrics/Performance 2019

作者： Dai, Osman Emre Cullina, Daniel Kiyavash, Negar Grossglauser, Matthias Department of Industrial and Systems Engineering Georgia Institute of Technology United States Department of Electrical Engineering Princeton University United States School of Computer and Communication Sciences École Polytechnique Fédérale de Lausanne Switzerland

ISBN: (纸本)9781450366786

Graph alignment in two correlated random graphs refers to the task of identifying the correspondence between vertex sets of the graphs. Recent results have characterized the exact informationtheoretic threshold for graph alignment in correlated Erdos-Rényi graphs. However, very little is known about the existence of efficient algorithms to achieve graph alignment without seeds. In this work we identify a region in which a straightforward O(n11/5 logn)-time canonical labeling algorithm, initially introduced in the context of graph isomorphism, succeeds in aligning correlated Erd?s-Rényi graphs. The algorithm has two steps. In the first step, all vertices are labeled by their degrees and a trivial minimum distance alignment (i.e., sorting vertices according to their degrees) matches a fixed number of highest degree vertices in the two graphs. Having identified this subset of vertices, the remaining vertices are matched using a alignment algorithm for bipartite graphs. © 2019 Copyright held by the owner/author(s).

关键词： Alignment

来源：评论

学校读者我要写书评

暂无评论

Load balancing guardrails: Keeping your heavy traffic on the road to low response times 19

Load balancing guardrails: Keeping your heavy traffic on the...

引用

14th Joint conference of International conference on measurement and modeling of computer systems, sigmetrics 2019 and IFIP Performance conference 2019, sigmetrics/Performance 2019

作者： Grosof, Isaac Scully, Ziv Harchol-Balter, Mor Carnegie Mellon University Computer Science Department PittsburghPA United States

ISBN: (纸本)9781450366786

Load balancing systems, comprising a central dispatcher and a scheduling policy at each server, are widely used in practice, and their response time has been extensively studied in the theoretical literature. While much is known about the scenario where the scheduling at the servers is First-Come-First-Served (FCFS), to minimize mean response time we must use Shortest-Remaining- Processing-Time (SRPT) scheduling at the servers. Much less is known about dispatching polices when SRPT scheduling is used. Unfortunately, traditional dispatching policies that are used in practice in systems with FCFS servers often have poor performance in systems with SRPT servers. In this paper, we devise a simple fix that can be applied to any dispatching policy. This fix, called guardrails, ensures that the dispatching policy yields optimal mean response time under heavy traffic when used in a system with SRPT servers. Any dispatching policy, when augmented with guardrails, becomes heavy-traffic optimal. Our results yield the first analytical bounds on mean response time for load balancing systems with SRPT scheduling at the servers. © 2019 Copyright held by the owner/author(s).

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

modeling BBR's Interactions with Loss-Based Congestion Control 19

Modeling BBR's Interactions with Loss-Based Congestion Contr...

引用

acm Internet measurement conference (IMC)

作者： Ware, Ranysha Mukerjee, Matthew K. Seshan, Srinivasan Sherry, Justine Carnegie Mellon Univ Pittsburgh PA 15213 USA Nefeli Networks Berkeley CA USA

ISBN: (纸本)9781450369480

BBR is a new congestion control algorithm (CCA) deployed for Chromium QUIC and the Linux kernel. As the default CCA for YouTube (which commands 11+% of Internet traffic), BBR has rapidly become a major player in Internet congestion control. BBR's fairness or friendliness to other connections has recently come under scrutiny as measurements from multiple research groups have shown undesirable outcomes when BBR competes with traditional CCAs. One such outcome is a fixed, 40% proportion of link capacity consumed by a single BBR flow when competing with as many as 16 loss-based algorithms like Cubic or Reno. In this short paper, we provide the first model capturing BBR's behavior in competition with loss-based CCAs. Our model is coupled with practical experiments to validate its implications. The key lesson is this: under competition, BBR becomes window-limited by its 'in-flight cap' which then determines BBR's bandwidth consumption. By modeling the value of BBR's in-flight cap under varying network conditions, we can predict BBR's throughput when competing against Cubic flows with a median error of 5%, and against Reno with a median of 8%.

关键词： computer operating systems

来源：评论

学校读者我要写书评

暂无评论

Proactive caching for low access-delay services under uncertain predictions 19

Proactive caching for low access-delay services under uncert...

引用

14th Joint conference of International conference on measurement and modeling of computer systems, sigmetrics 2019 and IFIP Performance conference 2019, sigmetrics/Performance 2019

作者： Liu, Ran Yeh, Edmund Eryilmaz, Atilla Electrical and Computer Engineering Northeastern University BostonMA United States Electrical and Computer Engineering Ohio State University ColumbusOH United States

ISBN: (纸本)9781450366786

Network traffic for delay-sensitive services has become a dominant part in the network. Proactive caching with the aid of predictive information has been proposed as a promising method to enhance delay performance. In this paper, we analytically investigate the problem of how to efficiently utilize uncertain predictive information to design proactive caching strategies with provably good access-delay characteristics. We first derive an upper bound for the average amount of proactive service per request that the system can support. We then analyze the behavior of a family of threshold-based proactive strategies using an innovative Markov chain analysis, and show that the average amount of proactive service per request can be maximized by properly selecting the threshold. Finally, we propose the UNIFORM strategy, which is the threshold-based strategy with the optimal threshold. Surprisingly, we show that it outperforms the commonly used Earliest-Deadline- First (EDF) type proactive strategies in terms of delay. We perform extensive numerical experiments to demonstrate the influence of thresholds on delay performance, and explicitly compare performance of the EDF strategy and the UNIFORM strategy. © 2019 Copyright held by the owner/author(s).

关键词： Queueing theory

来源：评论

学校读者我要写书评

暂无评论

Network resilience assessment via QoS degradation metrics: An algorithmic approach 19

Network resilience assessment via QoS degradation metrics: A...

引用

14th Joint conference of International conference on measurement and modeling of computer systems, sigmetrics 2019 and IFIP Performance conference 2019, sigmetrics/Performance 2019

作者： Nguyen, Lan N. Thai, My T. Department of Computer and Information Science and Engineering University of Florida United States

ISBN: (纸本)9781450366786

This paper focuses on network resilience to perturbation of edge weight. Other than connectivity, many network applications nowadays rely upon some measure of network distance between a pair of connected nodes. In these systems, a metric related to network functionality is associated to each edge. A pair of nodes only being functional if the weighted, shortest-path distance between the pair is below a given threshold T. Consequently, a natural question is on which degree the change of edge weights can damage the network functionality? With this motivation, we study a new problem, Quality of Service Degradation: given a set of pairs, find a minimum budget to increase the edge weights which ensures the distance between each pair exceeds T. We introduce four algorithms with theoretical performance guarantees for this problem. Each of them has its own strength in trade-off between effectiveness and running time, which are illustrated both in theory and comprehensive experimental evaluation. © 2019 Copyright held by the owner/author(s).

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Efficient distributed workload (re-)embedding 19

Efficient distributed workload (re-)embedding

引用

14th Joint conference of International conference on measurement and modeling of computer systems, sigmetrics 2019 and IFIP Performance conference 2019, sigmetrics/Performance 2019

作者： Henzinger, Monika Neumann, Stefan Schmid, Stefan Faculty of Computer Science University of Vienna Vienna Austria

ISBN: (纸本)9781450366786

Modern networked systems are increasingly reconfigurable, enabling demand-aware infrastructures whose resources can be adjusted according to the workload they currently serve. Such dynamic adjustments can be exploited to improve network utilization and hence performance, by moving frequently interacting communication partners closer, e.g., collocating them in the same server or datacenter. However, dynamically changing the embedding of workloads is algorithmically challenging: communication patterns are often not known ahead of time, but must be learned. During the learning process, overheads related to unnecessary moves (i.e., re-embeddings) should be minimized. This paper studies a fundamental model which captures the tradeoff between the benefits and costs of dynamically collocating communication partners on l servers, in an online manner. Our main contribution is a distributed online algorithm which is asymptotically almost optimal, i.e., almost matches the lower bound (also derived in this paper) on the competitive ratio of any (distributed or centralized) online algorithm. © 2019 Copyright held by the owner/author(s).

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

On the value of look-ahead in competitive online convex optimization 19

On the value of look-ahead in competitive online convex opti...

引用

14th Joint conference of International conference on measurement and modeling of computer systems, sigmetrics 2019 and IFIP Performance conference 2019, sigmetrics/Performance 2019

作者： Shi, Ming Lin, Xiaojun Jiao, Lei School of Electrical and Computer Engineering Purdue University West LafayetteIN United States Department of Computer and Information Science University of Oregon EugeneOR United States

ISBN: (纸本)9781450366786

Although using look-ahead information is known to improve the competitive ratios of online convex optimization (OCO) problems with switching costs, the competitive ratios obtained from existing results often depend on the cost coefficients of the problem, and can potentially be large. In this paper, we propose new online algorithms that can utilize look-ahead to achieve much lower competitive ratios for OCO problems with switching costs and hard constraints. For the perfect look-ahead case where the algorithm is provided with the exact inputs in a future look-ahead window of size K, we design an Averaging Regularized Moving Horizon Control (ARMHC) algorithm that can achieve a competitive ratio of K+1/K . To the best of our knowledge, ARMHC is the first to attain a low competitive ratio that is independent of either the coefficients of the switching costs and service costs, or the upper and lower bounds of the inputs. Then, for the case when the future look-ahead has errors, we develop aWeighting Regularized Moving Horizon Control (WRMHC) algorithm that carefully weights the decisions inside the look-ahead window based on the accuracy of the look-ahead information. As a result, WRMHC also achieves a low competitive ratio that is independent of the cost coefficients, even with uncertain hard constraints. Finally, our analysis extends online primal-dual analysis to the case with look-ahead by introducing a novel "re-stitching" idea, which is of independent interest. © 2019 Copyright held by the owner/author(s).

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共136页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：