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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是841-850 订阅

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

详细简洁

排序：

Scheduling policies to support distributed 3D multimedia applications 98

Scheduling policies to support distributed 3D multimedia app...

引用

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

作者： Thu D. Nguyen John Zahorjan Department of Computer Science and Engineering University of Washington Seattle WA

ISBN: (纸本)9780897919821

We consider the problem of scheduling the rendering component of 3D multimedia applications on a cluster of workstations connected via a local area network. Our goal is to meet a periodic real-time *** abstract terms, the problem we address is how best to schedule tasks with unpredictable service times on distinct processing nodes so as to meet a real-time deadline, given that all communication among nodes entails some (possibly large) overhead. We consider two distinct classes of schemes, static, in which task reallocations are scheduled to occur at specific times, and dynamic, in which reallocations are triggered by some processor going idle. For both classes we further examine both global reassignments, in which all nodes are rescheduled at a rescheduling moment, and local reassignments, in which only a subset of the nodes engage in rescheduling at any one *** show that global dynamic policies work best over a range of parameterizations appropriate to such systems. We introduce a new policy, Dynamic with Shadowing, that places a small number of tasks in the schedules of multiple workstations to reduce the amount of communication required to complete the schedule. This policy is shown to dominate the other alternatives considered over most of the parameter space.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Generating representative Web workloads for network and server performance evaluation 98

Generating representative Web workloads for network and serv...

引用

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

作者： Paul Barford Mark Crovella Computer Science Department Boston University 111 Cummington St Boston MA

ISBN: (纸本)9780897919821

One role for workload generation is as a means for understanding how servers and networks respond to variation in load. This enables management and capacity planning based on current and projected usage. This paper applies a number of observations of Web server usage to create a realistic Web workload generation tool which mimics a set of real users accessing a server. The tool, called Surge (Scalable URL Reference Generator) generates references matching empirical measurements of 1) server file size distribution; 2) request size distribution; 3) relative file popularity; 4) embedded file references; 5) temporal locality of reference; and 6) idle periods of individual users. This paper reviews the essential elements required in the generation of a representative Web workload. It also addresses the technical challenges to satisfying this large set of simultaneous constraints on the properties of the reference stream, the solutions we adopted, and their associated accuracy. Finally, we present evidence that Surge exercises servers in a manner significantly different from other Web server benchmarks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Queueing-based analysis of broadcast optical networks 98

Queueing-based analysis of broadcast optical networks

引用

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

作者： Martin W. McKinnon George N. Rouskas Harry G. Perros Georgia Tech Research Institute Atlanta GA Department of Computer Science North Carolina State University Raleigh NC

ISBN: (纸本)9780897919821

We consider broadcast WDM networks operating with schedules that mask the transceiver tuning latency. We develop and analyze a queueing model of the network in order to obtain the queue-length distribution and the packet loss probability at the transmitting and receiving side of the nodes. The analysis is carried out assuming finite buffer sizes, non-uniform destination probabilities and two-state MMBP traffic sources; the latter naturally capture the notion of burstiness and correlation, two important characteristics of traffic in high-speed networks. We present results which establish that the performance of the network is a complex function of a number of system parameters, including the load balancing and scheduling algorithms, the number of available channels, and the buffer capacity. We also show that the behavior of the network in terms of packet loss probability as these parameters are varied cannot be predicted without an accurate analysis. Our work makes it possible to study the interactions among the system parameters, and to predict, explain and fine tune the performance of the network.

关键词： wavelength division multiplexing optical networks Markov modulated Bernoulli process discrete-time queueing networks

来源：评论

学校读者我要写书评

暂无评论

Self-similarity in file systems 98

Self-similarity in file systems

引用

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

作者： Steven D. Gribble Gurmeet Singh Manku Drew Roselli Eric A. Brewer Timothy J. Gibson Ethan L. Miller Computer Science Division University of California Berkeley Computer Science and Electrical Engineering Department University of Maryland Baltimore County

ISBN: (纸本)9780897919821

We demonstrate that high-level file system events exhibit self-similar behaviour, but only for short-term time scales of approximately under a day. We do so through the analysis of four sets of traces that span time scales of milliseconds through months, and that differ in the trace collection method, the filesystems being traced, and the chronological times of the tracing. Two sets of detailed, short-term file system trace data are analyzed; both are shown to have self-similar like behaviour, with consistent Hurst parameters (a measure of self-similarity) for all file system traffic as well as individual classes of file system events. Long-term file system trace data is then analyzed, and we discover that the traces' high variability and self-similar behaviour does not persist across time scales of days, weeks, and months. Using the short-term trace data, we show that sources of file system traffic exhibit ON/OFF source behaviour, which is characterized by highly variably lengthed bursts of activity, followed by similarly variably lengthed periods of inactivity. This ON/OFF behaviour is used to motivate a simple technique for synthesizing a stream of events that exhibit the same self-similar short-term behaviour as was observed in the file system traces.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Implementing cooperative prefetching and caching in a globally-managed memory system 98

Implementing cooperative prefetching and caching in a global...

引用

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

作者： Geoffrey M. Voelker Eric J. Anderson Tracy Kimbrel Michael J. Feeley Jeffrey S. Chase Anna R. Karlin Henry M. Levy Department of Computer Science and Engineering University of Washington Department of Computer Science and Engineering University of Washington and IBM T.J. Watson Research Center Department of Computer Science and Engineering University of Washington and Department of Computer Science University of British Columbia Department of Computer Science and Engineering University of Washington and Department of Computer Science Duke University

ISBN: (纸本)9780897919821

This paper presents cooperative prefetching and caching --- the use of network-wide global resources (memories, CPUs, and disks) to support prefetching and caching in the presence of hints of future demands. Cooperative prefetching and caching effectively unites disk-latency reduction techniques from three lines of research: prefetching algorithms, cluster-wide memory management, and parallel I/O. When used together, these techniques greatly increase the power of prefetching relative to a conventional (non-global-memory) system. We have designed and implemented PGMS, a cooperative prefetching and caching system, under the Digital Unix operating system running on a 1.28 Gb/sec Myrinet-connected cluster of DEC Alpha workstations. Our measurements and analysis show that by using available global resources, cooperative prefetching can obtain significant speedups for I/O-bound programs. For example, for a graphics rendering application, our system achieves a speedup of 4.9 over a non-prefetching version of the same program, and a 3.1-fold improvement over that program using local-disk prefetching alone.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Application and evaluation of large deviation techniques for traffic engineering in broadband networks 98

Application and evaluation of large deviation techniques for...

引用

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

作者： Costas Courcoubetis Vasilios A. Siris George D. Stamoulis Dept. of Computer Science University of Crete and Institute of Computer Science (ICS) Foundation for Research and Technology - Hellas (FORTH) P.O. Box GR 711 10 Heraklion Crete Greece Institute of Computer Science (ICS) Foundation for Research and Technology - Hellas (FORTH) P.O. Box GR 711 10 Heraklion Crete Greece Dept. of Computer Science University of Crete and Institute of Computer Science (ICS) Foundation for Research and Technology - Hellas (FORTH) P.O. Box GR 711 10 Heraklion Crete Greece

ISBN: (纸本)9780897919821

Accurate yet simple methods for traffic engineering are important for efficient dimensioning of broadband networks. The goal of this paper is to apply and evaluate large deviation techniques for traffic engineering. In particular, we employ the recently developed theory of effective bandwidths, where the effective bandwidth depends not only on the statistical characteristics of the traffic stream, but also on a link's operating point through two parameters, the space and time parameters, which are computed using the many sources asymptotic. We show that this effective bandwidth definition can accurately quantify resource usage. Furthermore, we estimate and interpret values of the space and time parameters for various mixes of real traffic demonstrating how these values can be used to clarify the effects on the link performance of the time scales of burstiness of the traffic input, of the link parameters (capacity and buffer), and of traffic control mechanisms, such as traffic shaping. Our approach relies on off-line analysis of traffic traces, the granularity of which is determined by the time parameter of the link, and our experiments involve a large set of MPEG-1 compressed video and Internet Wide Area Network (WAN) traces, as well as modeled voice traffic.

关键词： large deviations broadband networks ATM effective bandwidths traffic engineering

来源：评论

学校读者我要写书评

暂无评论

Improving TCP throughput over two-way asymmetric links: analysis and solutions 98

Improving TCP throughput over two-way asymmetric links: anal...

引用

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

作者： Lampros Kalampoukas Anujan Varma K. K. Ramakrishnan Bell Laboratories Lucent Technologies 101 Crawfords Corner Rd. Holmdel NJ Computer Engineering Department University of California Santa Cruz CA AT&T Labs - Research Florham Park NJ

ISBN: (纸本)9780897919821

The sharing of a common buffer by TCP data segments and acknowledgments in a network or internet has been known to produce the effect of ack compression, often causing dramatic reductions in throughput. We study several schemes for improving the performance of two-way TCP traffic over asymmetric links where the bandwidths in the two directions may differ substantially, possibly by many orders of magnitude. These approaches reduce the effect of ack compression by carefully controlling the flow of data packets and acknowledgments. We first examine a scheme where acknowledgments are transmitted at a higher priority than data. By analysis and simulation, we show that prioritizing acks can lead to starvation of the low-bandwidth connection. Next, we introduce and analyze a connection-level backpressure mechanism designed to limit the maximum amount of data buffered in the outgoing IP queue of the source of the low-bandwidth connection. We show that this approach, while minimizing the queueing delay for acks, results in unfair bandwidth allocation on the slow link. Finally, our preferred solution separates the acks from data packets in the outgoing queue, and makes use of a connection-level bandwidth allocation mechanism to control their bandwidth shares. We show that this scheme overcomes the limitations of the previous approaches, provides isolation, and enables precise control of the connection throughputs. We present analytical models of the dynamic behavior of each of these approaches, derive closed-form expressions for the expected connection efficiencies in each case, and validate them with simulation results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Faster IP lookups using controlled prefix expansion 98

Faster IP lookups using controlled prefix expansion

引用

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

作者： V. Srinivasan George Varghese Department of Computer Science Washington University St. Louis

ISBN: (纸本)9780897919821

Internet (IP) address lookup is a major bottleneck in high performance routers. IP address lookup is challenging because it requires a longest matching prefix lookup. It is compounded by increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. We describe how IP lookups can be made faster using a new technique called controlled prefix expansion. Controlled prefix expansion, together with optimization techniques based on dynamic programming, can be used to improve the speed of the best known IP lookup algorithms by at least a factor of two. When applied to trie search, our techniques provide a range of algorithms whose performance can be tuned. For example, with 1 MB of L2 cache, trie search of the MaeEast database with 38,000 prefixes can be done in a worst case search time of 181 nsec, a worst case insert/delete time of 2.5 msec, and an average insert/delete time of 4 usec. Our actual experiments used 512 KB L2 cache to obtain a worst-case search time of 226 nsec, a worst-case worst case insert/delete time of 2.5 msec and an average insert/delete time of 4 usec. We also describe how our techniques can be used to improve the speed of binary search on prefix lengths to provide a scalable solution for IPv6. Our approach to algorithm design is based on measurements using the VTune tool on a Pentium to obtain dynamic clock cycle counts.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 1997 acm Sigmetrics international conference on measurement and modeling of computer systems

Proceedings of the 1997 ACM Sigmetrics International Confere...

引用

Proceedings of the 1997 acm Sigmetrics international conference on measurement and modeling of computer systems

The proceedings contains 26 papers from the 1997 acm Sigmetrics international conference on measurement and modeling of computer systems. Topics discussed include: network measurement and modeling;network resource management;parallel computer systems;memory management;benchmarking;computing and switching platforms;and storage systems.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

9th international conference on modeling Techniques and Tools for computer Performance Evaluation, 1997

9th International Conference on Modeling Techniques and Tool...

引用

9th international conferences on modeling Techniques and Tools for computer Performance Evaluation, 1997

ISBN: (纸本)9783540631019

The proceedings contain 18 papers. The special focus in this conference is on modeling Techniques and Tools for computer Performance Evaluation. The topics include: A performability modeling environment tool;dependability evaluation and the optimization of performability;design and implementation of a network computing platform using JAVA;storage alternatives for large structured state spaces;an efficient disk-based tool for solving very large markov models;efficient transient overload tests for real-time systems;towards an analytical tool for performance modeling of ATM networks by decomposition;an embedded network simulator to support network protocols’ development;synchronized two-way voice simulation for internet phone performance analysis and evaluation;processes as language-oriented building blocks of stochastic petri nets;measurement tools and modeling techniques for evaluating WEB server performance;workload characterization of input/output intensive parallel applications;interval based workload characterization for distributed systems;bounding the loss rates in a multistage ATM switch;simple bounds for queues fed by markovian sources and on queue length moments in fork and join queuing networks with general service times.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 81 82 83 84 85 86 87 88 89 90 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：