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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

967 篇 会议
47 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

658 篇 工学
- 589 篇 计算机科学与技术...
- 440 篇 软件工程
- 182 篇 信息与通信工程
- 107 篇 电气工程
- 100 篇 控制科学与工程
- 43 篇 网络空间安全
- 32 篇 电子科学与技术（可...
- 28 篇 动力工程及工程热...
- 26 篇 机械工程
- 25 篇 仪器科学与技术
- 15 篇 生物工程
- 10 篇 光学工程
- 10 篇 化学工程与技术
- 8 篇 建筑学
- 8 篇 环境科学与工程（可...
- 8 篇 生物医学工程（可授...
- 5 篇 力学（可授工学、理...
282 篇 理学
- 246 篇 数学
- 120 篇 统计学（可授理学、...
- 26 篇 系统科学
- 18 篇 生物学
- 17 篇 物理学
- 13 篇 化学
138 篇 管理学
- 115 篇 管理科学与工程(可...
- 82 篇 工商管理
- 29 篇 图书情报与档案管...
22 篇 法学
- 21 篇 社会学
19 篇 经济学
- 19 篇 应用经济学
7 篇 医学
- 6 篇 基础医学(可授医学...
- 6 篇 临床医学
6 篇 教育学
6 篇 农学
1 篇 文学
1 篇 军事学
1 篇 艺术学

主题

80 篇 measurement
76 篇 computational mo...
42 篇 computer archite...
31 篇 computer network...
29 篇 computer systems...
27 篇 analytical model...
23 篇 task analysis
23 篇 software
21 篇 mathematical mod...
18 篇 computer science
15 篇 predictive model...
15 篇 abstracts
15 篇 telecommunicatio...
15 篇 client server co...
14 篇 computer simulat...
14 篇 hardware
14 篇 response time (c...
14 篇 computer systems
13 篇 noise measuremen...
13 篇 computer operati...

机构

8 篇 department of co...
5 篇 school of comput...
4 篇 school of inform...
4 篇 carnegie mellon ...
4 篇 dept. of comp. s...
4 篇 computer science...
4 篇 department of co...
4 篇 department of co...
3 篇 school of comput...
3 篇 dept. of compute...
3 篇 department of co...
3 篇 school of comput...
3 篇 computer systems...
3 篇 key laboratory o...
3 篇 department of el...
3 篇 department of co...
3 篇 ibm thomas j. wa...
3 篇 department of co...
3 篇 computer science...
3 篇 dept. of comp. s...

作者

14 篇 towsley don
8 篇 liu alex x.
7 篇 wang jia
7 篇 harchol-balter m...
5 篇 wan jian
5 篇 crovella mark
5 篇 shenoy prashant
5 篇 van houdt benny
5 篇 li zongpeng
5 篇 xu jun
5 篇 vernon mary k.
5 篇 varró dániel
5 篇 lui john c. s.
5 篇 rexford jennifer
5 篇 scully ziv
4 篇 don towsley
4 篇 ji lusheng
4 篇 martonosi margar...
4 篇 zhang zhi-li
4 篇 wu chuan

语言

991 篇 英文
24 篇 其他
1 篇 中文

检索条件"任意字段=Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems"

共 1016 条记录，以下是941-950 订阅

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

详细简洁

排序：

On computing per-session performance bounds in high-speed multi-hop computer networks 92

On computing per-session performance bounds in high-speed mu...

引用

1992 acm SIGMETRICS Joint international conference on measurement and modeling of computer systems, SIGMETRICS/PERFORMANCE 1992

作者： Kurose, Jim Department of Computer Science University of Massachusetts AmherstMA01003 United States

ISBN: (纸本)0897915070

We present a technique for computing upper bounds on the distribution of individual per-session performance measures such as delay and buffer occupancy for networks in which sessions may be routed over several "hops." Our approach is based on first stochastically bounding the distribution of the number of packets (or cells) which can be generated by each traffic source over various lengths of time and then "pushing" these bounds (which are then shown to hold over new time interval lengths at various network queues) through the network on a per-session basis. Session performance bounds can then be computed once the stochastic bounds on the arrival process have been characterized for each session at all network nodes. A numerical example is presented and the resulting distributional bounds compared with simulation as well as with a point-valued worst-case performance bound. © acm 1992.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Collection of customers: A correlated M/G/1 queue 92

Collection of customers: A correlated M/G/1 queue

引用

1992 acm SIGMETRICS Joint international conference on measurement and modeling of computer systems, SIGMETRICS/PERFORMANCE 1992

作者： Borst, S.C. Boxma, O.J. Combé, M.B. CWI - Centre for Mathematics and Computer Science P.O. Box 4079 AB Amsterdam1009 Netherlands

ISBN: (纸本)0897915070

This paper analyses a variant of the M/G/1 queue in which the service times of arriving customers depend on the length of the interval between their arrival and the previous arrival. The dependence structure corresponds to the case of customers arriving according to an ordinary Poisson arrival process, and customer collectors being sent out according to a Poisson process to collect the customers and to bring them to the service facility. In this case collected numbers of customers, and hence total collected service requests, are positively correlated with the corresponding collect intervals. Viewing a batch of collected customers as one (super) customer gives rise to an M/G/1 queue with a positive correlation between service times of such customers and their interarrival times. Both for individual customers and for batches of collected customers we derive the transforms of the sojourn time and waiting time distributions. We also compare our results with those for the ordinary M/G/1 queue without dependence. © acm 1992.

关键词： Queueing theory

来源：评论

学校读者我要写书评

暂无评论

Factors in the abstract performance of the An1 computer network

Factors in the abstract performance of the An1 computer netw...

引用

1992 acm SIGMETRICS Joint international conference on measurement and modeling of computer systems, SIGMETRICS/PERFORMANCE 1992

作者： Owiicki, Susan S. Karlin, Anna R. DEC Systems Research Center 130 Lytton Ave. Palo AltoCA94301 United States

ISBN: (纸本)0897915070

AN1 (formerly known as Autonet) isalocal area network composed of crossbar switches interconnected by 100Mbit/second, full-duplex links. In this paper, we evaluate the performance impact of certain choices in the AN 1 design. These include the use of FIFO input buffering in the crossbar switch, the deadlock-avoidance mechanism, cut-through routnig, back-pressure for flow control, and multi-path rcmting. AN 1's performance goals were to provide low latency and high bandwidth in a lightly loaded network. In this it is successful. Under heavy load, the most serious impediment to good performance is the use of FIFO input buffers. The deadlock-avoidance technique has an adverse effect on the performance of some topologies, but it seems to be the best alternative, given the goals and constraints of the AN 1 design. Cut-through switching performs well relative to store-and-forward switching, even under heavy Ic)ad. Back-pressure deals adequately with congestion in a lightly-loaded network;under moderate load, performance is acceptable when coupled with end-to-end flow control for bursts. Multi-path routing successfully exploits redundant paths between hosts to improve performance in the face of congestion. © acm 1992.

关键词： Flow control

来源：评论

学校读者我要写书评

暂无评论

Cluster-based file replication in large-scale distributed systems 92

Cluster-based file replication in large-scale distributed sy...

引用

1992 acm SIGMETRICS Joint international conference on measurement and modeling of computer systems, SIGMETRICS/PERFORMANCE 1992

作者： Sandhu, Harjinder S. Zhou, Songnian Computer Systems Research Institute University of Toronto TorontoON Canada

ISBN: (纸本)0897915070

The increasing need for data sharing in large-scale distributed systems may place a heavy burden on critical resources such as file servers and networks. Our examination of the workload in one large commercial engineering environment shows that wide-spread sharing of unstable files among tens to hundreds of users is common. Traditional client-based file cacheing techniques are not scalable in such environments. We propose Frolic, a scheme for cluster-based file replication in large-scale distributed file systems. A cluster is a group of workstations and one or more file servers on a local area network. Large distributed systems may have tens or hundreds of clusters connected by a backbone network. By dynamically creating and maintaining replicas of shared files on the file servers in the clusters using those files, we effectively reduce reliance on central servers supporting such files, as well as reduce the distances between the accessing sites and data. We propose and study algorithms for the two main issues in Frolic, 1) locating a valid file replica, and 2) maintaining consistency among replicas. Our simulation experiments using a statistical workload model based upon measurement data and real workload characteristics show that clusterbased file replication can significantly reduce file access delays and server and backbone network utilizations in large-scale distributed systems over a wide range of workload conditions. The workload characteristics most critical to replication performance are: the size of shared files, the number of clusters that modify a file, and the number of consecutive accesses to files from a particular cluster. © acm 1992.

关键词： File organization

来源：评论

学校读者我要写书评

暂无评论

An analysis of dynamic page placement on a NUMA multiprocessor 92

An analysis of dynamic page placement on a NUMA multiprocess...

引用

1992 acm SIGMETRICS Joint international conference on measurement and modeling of computer systems, SIGMETRICS/PERFORMANCE 1992

作者： Larowe, Richard P. Holliday, Mark A. Ellis, Carla Schlatter Center for High Performance Computing Worcester Polytechnic Institute MarlboroMA01752 United States Department of Computer Science Duke University DurhamNC27706 United States

ISBN: (纸本)0897915070

The class of NUMA (nongniform Memory Access time) shared memory architectures is becoming increasingly important with the desire for larger scale multiprocessors. Insuchmachines, the placement and movement of code and data are crucial to performance. The operating system can play a role in managing placement through the policies and mechanisms of the virtual memory subsystem. In this paper, we develop an analytic model of memory system performance of a Local/ Remote NUMA architecture based on approximate mean-value analysis techniques. The model assumes that a simple workload model based on a few parameters can often provide insight into the general behavior of real applications. The model is validated against experimental data obtained with the DUnX operating system kernel for the BBN GP1OOO while running a synthetic workload. The results of this validation show that ill general, model predictions are quite good, though in some cases the model fails to include the effect of unexpected behaviors in the implementation. Experiments investigate the effectiveness of dynamic multiple-copy page placement. We investigate the cost of incorrect policy decisions by introducing different percentages of. © acm 1992.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Performance comparison of routing protocols using MaRS: Distance-Vector versus link-state 92

Performance comparison of routing protocols using MaRS: Dist...

引用

1992 acm SIGMETRICS Joint international conference on measurement and modeling of computer systems, SIGMETRICS/PERFORMANCE 1992

作者： Shankar, A. Udaya Alaettinoglu, Cengiz Matta, Ibrahim Dussa-Zieger, Klaudia Department of Computer Science University of Maryland College ParkMD20742 United States

ISBN: (纸本)0897915070

There are two approaches to adaptive routing protocols for wide-area store-and-forward networks: dista,ncevector and link-state. Dist ante-vector algorithms use O(IV x e) storage at each node, whereas link-state algorithms use O(i'V2), where A' is the number of nodes in the network and e is the average degree of a node. The ARPANET started with a distance-vector i@- rithm (Distributed Bellman-Ford), but because of longlived loops, changed to a link-state algorithm (SPF). We show, using a recently developed network sinmlator, MaRS, that a newly proposed distance-vector lalgorit hm (ExBF) performs as well as SPF. This suggests that distance-vector algorithms are appropriate for very large wide-area networks. © acm 1992.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

MemSpy: Analyzing memory system bottlenecks in programs 92

MemSpy: Analyzing memory system bottlenecks in programs

引用

1992 acm SIGMETRICS Joint international conference on measurement and modeling of computer systems, SIGMETRICS/PERFORMANCE 1992

作者： Martonosi, Margaret Gupta, Anoop Anderson, Thomas Computer Systems Laboratory Stanford University CA94305 United States Computer Science Division Univ. of California BerkeleyCA94720 United States

ISBN: (纸本)0897915070

To cope with the increasing difference between processor and main memory speeds, modem computer systems use deep memory hierarchies. In the presence of such hierarchies, the performance attained by an application is largely determined by its memory reference behavior- if most referemxx hit in the cache, the performance is significantly higher than if most references have to go to main memory. Frequently, it is possible for the programmer to restructure the data or code to achieve better memory reference behavior. Unfortunately, most existing perfommnce debugging tools do not assist the programmer in this component of the overall performance tuning task. This paper describes MemSpy, a prototype tool that helps programmed identify and fix memory bottlenecks in both sequential and parallel programs. A key aspect of MemSpy is that it introduces the notion of data oriented, in addition to code oriented, performance tuning. Thus, for both source level code objects and data objects, Mem- Spy provides information such as cache miss rates, causes of cache misses, and in multiprocessors, information on cache invalidations and local versus remote memory misses. MemSpy also introduces a concise matrix presentation to allow programmers to view both code and data oriented statistics at the same time. This paper presents design and implementation issues for MemSpy, and gives a detailed case study using MemSpy to tune a parallel sparse matrix application It shows how MemSpy helps pinpoint memory system bottlenecks, such as poor spatial locality and interference among data structures, and suggests paths for improvement. © acm 1992.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Characterizing and interpreting periodic behavior in computer systems 92

Characterizing and interpreting periodic behavior in compute...

引用

Proceedings of the 1992 acm SIGMETRICS joint international conference on measurement and modeling of computer systems

作者： Robert F. Berry Joseph L. Hellerstein IBM Research Division T.J. Watson Research Center Yorktown I-Ieights NY

No abstract available.

ISBN: (纸本)9780897915076

No abstract available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Algorithmic approach to bounding the mean response time of a minimum expected delay routing system 92

Algorithmic approach to bounding the mean response time of a...

引用

Proceedings of the 1992 acm SIGMETRICS joint international conference on measurement and modeling of computer systems

作者： John C. S. Lui Richard R. Muntz UCLA Computer Science Department Los Angeles CA USA

ISBN: (纸本)9780897915076

In this paper we present an algorithmic approach to bounding the mean response time of a multi-server system in which the minimum expected delay routing policy issued, i.e., an arriving job will join the queue which has the minimal expected value of unfinished work. We assume the queueing system to have K servers, each with an infinite capacity queue. The arrival process is Poisson with parameter λ, and the service time of server i is exponentially distributed with mean 1/μi, 1 ≤ i ≤ K. The computation algorithm we present allows one to tradeoff accuracy and computational cost. Upper and lower bounds on the expected response time and expected number of customers are computed; the spread between the bounds can be reduced with additional space and time complexity. Examples are presented which illustrate the excellent relative accuracy attainable with relatively little computation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Factors in the performance of the AN1 computer network 92

Factors in the performance of the AN1 computer network

引用

Proceedings of the 1992 acm SIGMETRICS joint international conference on measurement and modeling of computer systems

作者： Susan S. Owicki Anna R. Karlin DEC Systems Research Center 130 Lytton Ave. Palo Alto CA

ISBN: (纸本)9780897915076

AN1 (formerly known as Autonet) is a local area network composed of crossbar switches interconnected by 100Mbit/second, full-duplex links. In this paper, we evaluate the performance impact of certain choices in the AN1 design. These include the use of FIFO input buffering in the crossbar switch, the deadlock-avoidance mechanism, cut-through routing, back-pressure for flow control, and multi-path routing. AN1's performance goals were to provide low latency and high bandwidth in a lightly loaded network. In this it is successful. Under heavy load, the most serious impediment to good performance is the use of FIFO input buffers. The deadlock-avoidance technique has an adverse effect on the performance of some topologies, but it seems to be the best alternative, given the goals and constraints of the AN1 design. Cut-through switching performs well relative to store-and-forward switching, even under heavy load. Back-pressure deals adequately with congestion in a lightly-loaded network; under moderate load, performance is acceptable when coupled with end-to-end flow control for bursts. Multi-path routing successfully exploits redundant paths between hosts to improve performance in the face of congestion.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 91 92 93 94 95 96 97 98 99 100 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：