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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

1,340 篇 电子文献
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,315 篇 英文
24 篇 其他
1 篇 中文

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

共 1340 条记录，以下是1201-1210 订阅

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

详细简洁

排序：

On the applicability of using multiprogramming level distributions 85

On the applicability of using multiprogramming level distrib...

引用

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

作者： Dowdy, Lawrence W. Chopra, Manvinder S. Computer Science Department Vanderbilt University NashvilleTN37235 United States

ISBN: (纸本)0897911695

A computer system's workload is represented by its multiprogramming level, which is defined as the number of tasks (fobs, customers) which actively compete tor resources within the system. In a product-form queuing network model of the system, the workload is modeled by assuming that the multiprogramming level is neither fixed level is neither fixed nor governed by an outside arrival process. In an actual system., the multiprogramming level varies due to features such as task spawning, killing, blocking, parallel processing, and/or simultaneous resource possession. The multiprogramming level is a random variable with an associated distribution. This paper demonstrates that improved models can result from using this multiprogramming level distribution information. Several examples relative to open versus closed models, subsystem models, actual system models, and blocking models are given which demonstrate the applicability of using multiprogramming level distributions. This applicability, shown via the examples, is the main contribution of the paper. The examples also motivate interesting theoretical results relating to open models, closed models, and subsystem models. © 1985 acm.

关键词： Multiprogramming

来源：评论

学校读者我要写书评

暂无评论

Performance characteristics of 2 ethernets: An experimental study

Performance characteristics of 2 ethernets: An experimental ...

引用

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

作者： Gonsalves, Timothy A. Computer Systems Laboratory Department of Electrical Engineering Stanford University StanfordCA94305 United States

ISBN: (纸本)0897911695

Local computer networks are increasing in popularity for the interconnection of computers for a variety of applications. One such network that has been implemented on a large scale is the Ethernet. This paper describes an experimental performance evaluation of a 3 and a 10 Mb/s Ethernet. The effects of varying packet length and transmission speed on throughput, mean delay and delay distribution are quantified. The protocols are seen to be fair and stable. These measurements span the range from the region of high performance of the CSMA/CD protocol to the upper limits of its utility where performance is degraded. The measurements are compared to the predictions of existing analybical models. The correlation is found to range from good to poor, with more sophisticated models yielding better results tban a simple one. © 1985 acm.

关键词： Ethernet

来源：评论

学校读者我要写书评

暂无评论

The effect of system workload on error latency: An experimental study 85

The effect of system workload on error latency: An experimen...

引用

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

作者： Chillarege, R. Iyer, R.K. Computer Systems Group Coordinated Science Laboratory University of Illinois at Urbana-Champaign UrbanaIL61801 United States

ISBN: (纸本)0897911695

In this paper, a methodology for determining and characterizing error latency is developed. The method is based on real workload data, gathered by an experiment instrumented on a VAX 11/780 during the normal workload cycle of the installation. This is the first attempt at jointly studying error latency and workload variations in a full production system. Distributions of error latency were generated by simulating the occurrence of faults under varying workload conditions. A family of error latency distributions so generated illustrate that error latency is not so much a function of when in time a fault occurred but rather a function of the workload that followed the failure. The study finds that the mean error latency varies by a 1 to 8 (hours) ratio between high and low workloads. The method is general and can be applied to any system. © 1985 acm.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

A comparison of receiver-initiated and sender-initiated adaptive load sharing 85

A comparison of receiver-initiated and sender-initiated adap...

引用

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

作者： Eager, Derek L. Lazowska, Edward D. Zahorjan, John Department of Computational Science University of Saskatchewan Canada Department of Computer Science University of Washington United States

ISBN: (纸本)0897911695

One goal of locally distributed systems is to facilitate resource sharing. Most current locally distributed systems, however, share primarily data, data storage devices, and output devices; there is little sharing of computational resources. Load sharing is the process of sharing computational resources by transparently distributing the system workload. System performance can be improved by transferring work from nodes that are heavily loaded to nodes that are lightly *** sharing policies may be either static or adaptive. Static policies use only information about the average behavior of the system; transfer decisions are independent of the actual current system state. Static policies may be either deterministic (e.g., “transfer all compilations originating at node A to server B”) or probabilistic (e.g., “transfer half of the compilations originating at node A to server B, and process the other half locally”).

关键词：

来源：评论

学校读者我要写书评

暂无评论

A sensitivity study of the clustering approach to workload modeling 85

A sensitivity study of the clustering approach to workload m...

引用

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

作者： Caluarossat, Maria Ferrari, Domenico Computer Science Division Department of Electrical Engineering and Computer Sciences Electronics Research Laboratory University of California Berkeley United States

ISBN: (纸本)0897911695

In a paper published in 1984 [Ferr84], the validity of applying clustering techniques to the design of an executable model for an interactive workload was discussed. The following assumptions, intended not to be necessarily realistic but to provide sufficient conditions for the applicability of clustering techniques, were made:The system whose workload is to be modeled is an interactive system, and its performance can be accurately evaluated by solving a product-form closed queueing network *** behavior of each interactive user can be adequately modeled by a probabilistic graph (called a user behavior graph); in such a graph, each node represents an interactive command type, and the duration of a user's stay in the node probabilistically equals the time the user spends typing in a command of that type, waiting for the system's response, and thinking about what command should be input *** interactive workload to be modeled is stationary, and the workload model to be constructed is intended to reproduce its global characteristics (not those of some brief excerpt from it exhibiting peculiar dynamics), hence to be stationary as *** was shown in [Ferr84] that, under these assumptions, clustering command types having the same probabilistic resource demands does not affect the values of the performance indices the evaluators are usually interested in, provided the visit ratio to each node in the reduced (i.e., post-clustering) user behavior graph is equal to the sum of the visit ratios the cluster's components had in the original *** the reduction we have just described is equivalent to replacing each cluster with one or more representatives of its components, and since this is also the goal of applying clustering techniques to the construction of executable workload models substantially more compact than the original workload to be modeled, this result shows that such techniques are valid (i.e., produce accurate models) when the assumptions and the

关键词：

来源：评论

学校读者我要写书评

暂无评论

An approximate numerical solution for multiclass preemptive priority queues with general service time distributions 85

An approximate numerical solution for multiclass preemptive ...

引用

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

作者： Snyder, Patricia M. Stewart, William J. Operations Research Program North Carolina State University RaleighNC27695 United States Department of Computer Science North Carolina State University RaleighNC27895 United States

ISBN: (纸本)0897911695

In this paper an approximate numerical solution for a multiclass preemptive priority single server queue is developed. The arrival process of each class follows a Poisson distribution. The service time distribution must have a rational Laplace transform, but is otherwise arbitrary and may be different for different classes. The work reported here was motivated by a desire to compute the equilibrium probability distribution of networks containing preemptive priority servers. Such networks are frequently encountered when modeling computer systems, medical care delivery systems and communication networks. We wish to use an iterative technique which constructs a series of two station networks consisting of one station from the original network and one “complementary” station whose behavior with respect to the original station mimics that of the rest of the network. At each iteration, it is necessary to compute the equilibrium probability distribution of one or more preemptive priority *** such queues have been studied for some time, the resulting solutions have most often been developed utilizing transforms or probability generating functions, e.g. Jaiswal [1968]; in many cases of interest, inversion has not been attempted. Miller [1981] presented explicit solutions for two class priority queues but Miller's work, which is based on that of Neuts, is limited to exponential service times and two classes. The approach presented here is applicable to many classes and to more general service time distributions than have previously been *** algorithm utilizes a bootstrap approach, a concept borrowed from dynamic programming. The solution for class 1 is trivial. Once we have solved the system with k different classes, we have available all the necessary information to solve the system with k+l classes. We shall assume that each class has a distinct service time distribution Gk, with mean gk and variance s2k. Let class k have preemptive priority over clas

关键词：

来源：评论

学校读者我要写书评

暂无评论

Degradable computer systems with dependent subsystems 85

Degradable computer systems with dependent subsystems

引用

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

作者： Halin M. Khelalfa Anneliese K. von Mayrhauser Department of Computer Sciences Illinois Institute of Technology Chicago IL

ISBN: (纸本)9780897911696

When building a model for degradable computer systems, it is not sufficient to merely quantify reliability and performance measures. These indices must be mathematically sound if they are to be used to design such systems in an optimal way. The paper presents an analysis of design optimisation for degradable computer systems and shows how this particular application leads to a system model with interdepedent subsystems. A procedure is presented on how to solve the resulting Markov model. Its computational complexity is compared to another solution method and shown to be largely more efficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Performance characteristics of two Ethernets: an experimental study 85

Performance characteristics of two Ethernets: an experimenta...

引用

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

作者： Timothy A. Gonsalves Computer Systems Laboratory Department of Electrical Engineering Stanford University Stanford CA

ISBN: (纸本)9780897911696

Local computer networks are increasing in popularity for the interconnection of computers for a variety of applications. One such network that has been implemented on a large scale is the Ethernet. This paper describes an experimental performance evaluation of a 3 and a 10 Mb/s Ethernet. The effects of varying packet length and transmission speed on throughput, mean delay and delay distribution are quantified. The protocols are seen to be fair and stable. These measurements span the range from the region of high performance of the CSMA/CD protocol to the upper limits of its utility where performance is degraded. The measurements are compared to the predictions of existing analytical models. The correlation is found to range from good to poor, with more sophisticated models yielding better results than a simple one.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An analytic model of the hyperchannel network using multiple channel architecture 85

An analytic model of the hyperchannel network using multiple...

引用

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

作者： I. Chlamtac M. Eisinger Computer Science Department Technion - Israel Institute of Technology

ISBN: (纸本)9780897911696

The HYPERchannel communication network configured around one to four channels is considered. We develop a queueing model which characterizes the network performance as a function of the number of channels, the channel load and the number of stations in the network. The model is used to analyze the multichannel system performance and to evaluate the effect of the channel selection mechanism, as implemented by the HYPERchannel station interface units, on the *** is shown that the network bandwidth utilization is directly related to the channel selection process and that it varies with network configuration and load. These observed relations are especially significant since they are most pronounced in networks with small number of stations, the typical configuration in the majority of operational HYPERchannel networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multiclass queueing networks with population constrainted subnetworks 85

Multiclass queueing networks with population constrainted su...

引用

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

作者： A. E. Krzesinski P. Teunissen Institute for Applied Computer Science University of Stellenbosch 7600 Stellenbosch South Africa

ISBN: (纸本)9780897911696

A Multiclass Queueing Network model (MQN) is partitioned into a set of disjoint subnetworks. Population constraints are applied to each subnetwork such that within each subnetwork each population chain is either subject to an individual population constraint, or a group of chains may be subject to a common (shared) population constraint. Such population constraints are necessary in order to model multiprogramming level constraints in mainframe computer systems and window flow control mechanisms in computer communication networks. A computationally efficient approximate solution method is developed for solving MQN's with population constraints. Each subnetwork is reduced to a single approximately flow equivalent composite centre by assuming that the effect of other chains on a given chain can be adequately represented by their average customer populations. The accuracy of the population constraint approximation is compared against previous techniques by applying it to a set of test cases for which simulation solutions have previously been reported. The accuracy of the approximation technique is found to be good and in general is an improvement over previously published concurrency constraint approximations.

关键词： product form solutions multiclass queueing networks mean value analysis approximate solution

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共134页 << < 117 118 119 120 121 122 123 124 125 126 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：