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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,246 篇 会议
90 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

914 篇 工学
- 846 篇 计算机科学与技术...
- 602 篇 软件工程
- 269 篇 信息与通信工程
- 148 篇 电气工程
- 146 篇 控制科学与工程
- 63 篇 电子科学与技术（可...
- 58 篇 网络空间安全
- 31 篇 机械工程
- 31 篇 动力工程及工程热...
- 24 篇 材料科学与工程（可...
- 23 篇 仪器科学与技术
- 21 篇 生物工程
- 10 篇 建筑学
- 10 篇 化学工程与技术
- 9 篇 力学（可授工学、理...
- 9 篇 光学工程
- 8 篇 交通运输工程
- 7 篇 土木工程
- 7 篇 环境科学与工程（可...
422 篇 理学
- 365 篇 数学
- 181 篇 统计学（可授理学、...
- 35 篇 系统科学
- 25 篇 物理学
- 22 篇 生物学
- 17 篇 化学
188 篇 管理学
- 163 篇 管理科学与工程(可...
- 103 篇 工商管理
- 35 篇 图书情报与档案管...
27 篇 法学
- 26 篇 社会学
24 篇 经济学
- 24 篇 应用经济学
6 篇 农学
5 篇 教育学
4 篇 医学
2 篇 军事学

主题

64 篇 computer systems...
53 篇 computer network...
36 篇 computer simulat...
35 篇 measurement
29 篇 computational mo...
27 篇 computer archite...
23 篇 wireless sensor ...
23 篇 computer operati...
20 篇 distributed comp...
19 篇 computer systems
17 篇 queueing network...
17 篇 scheduling
16 篇 analytical model...
16 篇 telecommunicatio...
15 篇 client server co...
14 篇 response time (c...
14 篇 sensor networks
13 篇 performance
13 篇 computer softwar...
12 篇 computer science

机构

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
7 篇 harchol-balter m...
6 篇 don towsley
6 篇 dowdy lawrence w...
6 篇 wood david a.
6 篇 anon
6 篇 van houdt benny
5 篇 pai vivek s.
5 篇 feamster nick
5 篇 martonosi margar...

语言

1,311 篇 英文
24 篇 其他
1 篇 中文

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

共 1336 条记录，以下是1221-1230 订阅

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

详细简洁

排序：

Characterization of an optimal delayed resolution policy 83

Characterization of an optimal delayed resolution policy

引用

1983 acm sigmetrics conference on measurement and modeling of computer systems, sigmetrics 1983

作者： Thareja, Ashok K. Agrawala, Ashok K. Department of Computer Science University of Maryland College ParkMD20740 United States BGS Systems Inc. One University Office Park WalthamMA02254 United States

ISBN: (纸本)0897911121

A class of policies called stationary delayed resolution policies have been proposed recently for sharing finite number of buffers at a store-and-forward node in a message switching network [9]. It has been shown that with respect to the total weighted throughput these policies comprise the optimal class of policies. In this paper, we present methods to obtain an optimal policy from the class of stationary delayed resolution policies for given values of the parameters. A method based upon policy iteration technique for Markov decision processes is used to obtain the optimal delayed resolution policy. It is shown that the policy iteration technique while useful in obtaining the exact optimal policy becomes intractable for practical values of buffer sizes and number of message classes. A class of policies called SRS delayed resolution policies is proposed. It is shown that the best SRS delayed resolution policies closely approximate the performance of the optimal delayed resolution policies. © 1983 acm.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

On the BLI-model of program behaviour 83

On the BLI-model of program behaviour

引用

1983 acm sigmetrics conference on measurement and modeling of computer systems, sigmetrics 1983

作者： Haikala, Ilkka J. Pohjanlahti, Harri Department of Computer Science University of Helsinki Tukholmankatu 2 Helsinki 25SF-00250 Finland OKO Bank Finland PL 308 Helsinki 10SF-00101 Finland

ISBN: (纸本)0897911121

The BLI-model of program behaviour is sometimes referred to as an exact measure of the locality structure of the programs. However, only limited experimental data is available of the applicability of the BLI-model. In this paper the characteristics of the BLI-model are studied with relatively large empirical data. References to code segments, data segments and references to paged data segments are used in the experiments. The good coverage percentages reported in earlier studies with data segments, are present in our data also. However, the code referencing behaviour turns out to be totally different. Typically only some 50% of the execution time is covered with BLI's of acceptable length. This is shown to be a consequence of occasional references to segments not belonging to the phase or joining the phase during the phase. The behaviour of paged data segments is typically nearer to the behaviour of the code segments than that of the data segments. The BLI-model is also compared with the VMIN-algorithm. A relatively close correspondence between reasonably long BLI's and the VMIN-sets is observed. In general, the results reported in this paper indicate, that the BLI-model can be used with data segments only, or when information concerning short stable phases of the execution is sufficient. © 1983 acm.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

Performance models of token ring local area networks 83

Performance models of token ring local area networks

引用

1983 acm sigmetrics conference on measurement and modeling of computer systems, sigmetrics 1983

作者： Berry, Robert Chandy, K. Mani Department of Computer Sciences University of Texas AustinTX78712 United States

ISBN: (纸本)0897911121

This paper presents a simple heuristic analytic algorithm for predicting the “response times” of messages in asymmetric token ring local area networks. A description of the token ring and the model is presented in section 2 the algorithm is described in section 3 and the empirical results in section 4. The analytic results were compared against a detailed simulation model and the results are extremely close over a wide range of *** area networks (or LANS) offer a very attractive solution to the problem of connecting a large number of devices distributed over a small geographic area. They are an inexpensive readily expandable and highly flexible communications media. They are the backbone of the automated office - a significant component of the office of the *** importance of LANS in the future of applied computer science has resulted in a tremendous burst of interest in the study of their behaviour. There are already many different LAN architectures proposed and studied in the literature [Tropper 81] [Tannenbaum 81] [Babic 78] [Metcalfe 76] [Clark 78] One LAN architecture is significant for several reasons. This architecture is the token ring [Carsten 77]. It has attracted interest because of its simplicity fairness and efficiency. The interest it has generated has resulted in the proposal of several different versions. This paper concentrates on one of these versions - the single token token ring protocol as described in [Bux 81]. This particular version is attractive because of its overall simplicity and reliability. This paper presents an algorithm for predicting response times in a token ring with the single token protocol.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Workload representations in queueing models of computer systems 83

Workload representations in queueing models of computer syst...

引用

1983 acm sigmetrics conference on measurement and modeling of computer systems, sigmetrics 1983

作者： Zahorjan, John Department of Computer Seience University of Washington SeattleWA United States

ISBN: (纸本)0897911121

There are two basic representations of workload populations in load independent, separable queueing network models. These correspond to the notions of open and closed classes, an open class being one in which customers may arrive and depart the model, and a closed class being one in which the number of customers is fixed. This paper examines the effect on mean system performance measures of the workload representation chosen. Open and closed representations are compared under the equivalency constraints that they result in identical system throughput or mean system population level for the class being considered. It is shown formally for a limited class of networks that the open representation results in larger system response times than equivalent closed representations, and that one of the closed representations results in the smallest system response time of those considered. Extensive numerical results show for a more general class of models that there is a strict ordering (in terms of system response time) of the natural class representations considered. These results can be used in at least two ways. One is to guide the initial representation of computer system workloads in performance models. The other application is as a component of approximate analysis techniques for queueing models that decompose individual networks into multiple submodels, each of which is then solved in isolation. Here the goal is to represent customer classes in each submodel in a way that is convenient computationally, and that results in performance measures closely matching those observed in the full network. It is this latter application that we assume in this paper. An example of the application of our results to an existing approximation technique is given. © 1983 acm.

关键词： Queueing theory

来源：评论

学校读者我要写书评

暂无评论

HOPT: A myopic version of the STOCHOPT automatic file migration policy 83

HOPT: A myopic version of the STOCHOPT automatic file migrat...

引用

1983 acm sigmetrics conference on measurement and modeling of computer systems, sigmetrics 1983

作者： Olken, Frank Computer Science and Mathematics Dept. Lawrence Berkeley Laboratory University of California BerkeleyCA94720 United States

ISBN: (纸本)0897911121

The STOCHOPT automatic file migration policy (proposed by A.J. Smith) minimizes the expected retention and recall costs of an abitrarily sized file. We consider the application of the STOCHOPT policy to a file system in which the file inter-reference time (IRT) distributions are characterized by strictly monotonically decreasing hazard rates (SDHR) (also known as decreasing failure rates, DFR). We show that in this case the STOCHOPT policy can be simply stated in terms of a scaled hazard rate, i.e., the hazard rate divided by the file size. Such decreasing failure rate distributions have been used by Smith to model empirically observed file inter-reference times. © 1983 acm.

关键词： Failure analysis

来源：评论

学校读者我要写书评

暂无评论

Queueing analysis of a canonical model of real-time multiprocessors 83

Queueing analysis of a canonical model of real-time multipro...

引用

1983 acm sigmetrics conference on measurement and modeling of computer systems, sigmetrics 1983

作者： Krishna, C.M. Shin, K.G. Computing Research Laboratory Department of Electrical and Computer Engineering University of Michigan Ann ArborMI48109 United States

ISBN: (纸本)0897911121

Multiprocessors are beginning to be regarded increasingly favorably as candidates for controllers in critical real-time control applications such as aircraft. Their considerable tolerance of component failures together with their great potential for high throughput are contributory factors. In this paper, we present first a logical classification of multiprocessor structures with control applications in mind. We point out that one important subclass has hitherto been neglected by the analysts. This is a class of systems with a common memory, minimal interprocessor communication and perfect processor symmetry. The performance characteristic of the greatest importance in real-time applications is the response time distribution. Indeed, we have shown in a separate paper [2] how it is possible to characterize rigorously and objectively the performance of a real-time multiprocessor given the application and the multiprocessor response time distribution and component failure characteristics. We therefore present here a computation of the response time distribution for a canonical model of real-time multiprocessor. To do so, we approximate the multiprocessor by a blocking model and present a means for efficient analysis. Two separate models are derived: one created from the system's point of view, and the other from the point of view of an incoming task. The former model is analyzed along largely conventional lines. For the latter model, an artificial server is used, and the system is transformed into a queueing network. © 1983 acm.

关键词： Real time control

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of checkpointing strategies 83

Performance analysis of checkpointing strategies

引用

proceedings of the 1983 acm sigmetrics conference on measurement and modeling of computer systems

作者： Asser N. Tantawi Manfred Ruschitzka IBM Thomas J. Watson Research Center Yorktown Heights New York Department of Electrical and Computer Engineering University of California Davis California

ISBN: (纸本)9780897911122

A widely used error recovery technique in database systems is the rollback and recovery technique. This technique saves periodically the state of the system and records all activities on a reliable log tape. The operation of saving the system state is called checkpointing. The elapsed time between two consecutive checkpointing operations is called checkpointing interval. When the system fails, the recovery process uses the log tape and the state saved at the most recent checkpoint to bring the system to the correct state that preceded the failure. This process is called error recovery and consists of loading the most recent state and then reprocessing all the activities, stored on the log tape, that took place since the most recent checkpoint and prior to *** models of rollback and recovery assumed Poisson failures and fixed (or exponential) checkpointing intervals. Extending these models, we consider general failure distributions. We also allow checkpointing intervals to depend on the reprocessing time (the time elapsed between the most recent checkpoint prior to failure and the time of failure) and the failure distribution. Furthermore, failures may occur during the checkpointing and error recovery. Our general model unifies a variety of models that have previously been *** denote by Fi; and t(Fi), i = 1, 2, ..., the ith failure that occurs during normal processing (not during error recovery) and the time of its occurrence, respectively. We refer to the time period Li = t(Fi+1) − t(Fi), i = 1, 2, ..., as the ith cycle whose length is Li. It consists of two portions: the total error recovery time and the normal processing time. The reprocessing time associated with failure Fi is denoted by Yi−1. Since the variables of the ith cycle depend at most on one variable of the (i − 1)st cycle, namely Yi−1, the stochastic process of the reprocessing time {Yi; i≥0} is a Markov process. We obtain the transition probability density function and the stati

关键词：

来源：评论

学校读者我要写书评

暂无评论

proceedings of the 1982 acm sigmetrics conference on measurement and modeling of computer systems, sigmetrics 1982

Proceedings of the 1982 ACM SIGMETRICS Conference on Measure...

引用

1982 acm sigmetrics conference on measurement and modeling of computer systems, sigmetrics 1982

ISBN: (纸本)0897910796

The proceedings contain 27 papers. The topics discussed include: the effective management of paging storage hierarchies;workload characterization and performance evaluation in a research environment;a package for the implementation of static workload models;the mesa spy. an interactive tool for performance debugging;modelling of the parallel resolution of a numerical problem on a locally distributed computing system;on state-dependent workload characterization by software resources;a package for the implementation of static workload models;workload characterization and performance evaluation in a research environment;a database replication analysis using an M/M/m queue with service interruptions;program page reference patterns;stationary deterministic flows in discrete systems;measuring simultaneous events in a multiprocessor system;the effective management of paging storage hierarchies;the Mesa Spy: an interactive tool for performance debugging;and hierarchical replacement decisions in hierarchical stores.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A model of transport level flow control 82

A model of transport level flow control

引用

1982 acm sigmetrics conference on measurement and modeling of computer systems, sigmetrics 1982

作者： Harbitter, Alan Tripathi, Satish K. Department of Computer Science University of Maryland College ParkMD20742 United States

ISBN: (纸本)0897910796

A Markov Decision Process model is developed to analyze buffer assignment at the transport level of the ARPAnet protocol. The result of the analysis is a method for obtaining an assignment policy which is optimal with respect to a delay/throughput/overhead reward function. The nature of the optimal policy is investigated by varying parameters of the reward. © 1982 acm.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

HAM: The heuristic aggregation method: For solving general closed queueing network models of computer systems 82

HAM: The heuristic aggregation method: For solving general c...

引用

1982 acm sigmetrics conference on measurement and modeling of computer systems, sigmetrics 1982

作者： Neuse, Doug Chandy, K. Mani Department of Computer Sciences University of Texas at Austin AustinTX78712 United States

ISBN: (纸本)0897910796

An approximate analytical method for estimating performance statistics of general closed queueing network models of computing systems is presented. These networks may include queues with priority scheduling disciplines and nonexponential servers and several classes of jobs. The method is based on the aggregation theorem (Norton's theorem) of Chandy, Herzog and Woo. © 1982 acm.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共134页 << < 119 120 121 122 123 124 125 126 127 128 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：