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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Improving dynamic voltage scaling algorithms with PACE 01

Improving dynamic voltage scaling algorithms with PACE

引用

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

作者： Jacob R. Lorch Alan Jay Smith Computer Science Division EECS Department University of California at Berkeley Berkeley CA

ISBN: (纸本)9781581133349

This paper addresses algorithms for dynamically varying (scaling) CPU speed and voltage in order to save energy. Such scaling is useful and effective when it is immaterial when a task completes, as long as it meets some deadline. We show how to modify any scaling algorithm to keep performance the same but minimize expected energy consumption. We refer to our approach as PACE (Processor Acceleration to Conserve Energy) since the resulting schedule increases speed as the task progresses. Since PACE depends on the probability distribution of the task's work requirement, we present methods for estimating this distribution and evaluate these methods on a variety of real workloads. We also show how to approximate the optimal schedule with one that changes speed a limited number of times. Using PACE causes very little additional overhead, and yields substantial reductions in CPU energy consumption. Simulations using real workloads show it reduces the CPU energy consumption of previously published algorithms by up to 49.5%, with an average of 20.6%, without any effect on performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dynamic multi-path routing: asymptotic approximation and simulations 01

Dynamic multi-path routing: asymptotic approximation and sim...

引用

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

作者： Xun Su Gustavo de Veciana Department of Electrical and Computer Engineering University of Texas Austin TX

ISBN: (纸本)9781581133349

In this paper we study the dynamic multi-path routing problem. We focus on an operating regime where traffic flows arrive at and depart from the network in a bursty fashion, and where the delays involved in link state advertisement may lead to "synchronization" effects that adversely impact the performance of dynamic single-path routing *** start by analyzing a simple network of parallel links, where the goal is to minimize the average increase in network congestion on the time scale of link state advertisements. We consider an asymptotic regime leading to an optimization problem permitting closed-form analysis of the number of links over which dynamic multi-path routing should be conducted. Based on our analytical result we examine three types of dynamic routing schemes, and identify a robust policy, i.e., routing the traffic to a set of links with loads within a factor of the least loaded, that exhibits robust performance. We then propose a similar policy for mesh networks and show by simulation some of its desirable properties. The main results suggest that our proposal would provide significant performance improvement for high speed networks carrying bursty traffic flows.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The effects of wide-area conditions on WWW server performance 01

The effects of wide-area conditions on WWW server performanc...

引用

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

作者： Erich M. Nahum Marcel-Catalin Rosu Srinivasan Seshan Jussara Almeida Networked Systems Department IBM T.J. Watson Research Ctr. Yorktown Heights NY Dept. of Computer Science Carnegie-Mellon Univ. Pittsburgh PA Dept. of Computer Science University of Wisconsin Madison WI

ISBN: (纸本)9781581133349

WWW workload generators are used to evaluate web server performance, and thus have a large impact on what performance optimizations are applied to servers. However, current benchmarks ignore a crucial component: how these servers perform in the environment in which they are intended to be used, namely the wide-area *** paper shows how WAN conditions can affect WWW server performance. We examine these effects using an experimental test-bed which emulates WAN characteristics in a live setting, by introducing factors such as delay and packet loss in a controlled and reproducible fashion. We study how these factors interact with the host TCP implementation and what influence they have on web server performance. We demonstrate that when more realistic wide-area conditions are introduced, servers exhibit very different performance properties and scaling behaviors, which are not exposed by existing benchmarks running on LANs. We show that observed throughputs can give misleading information about server performance, and thus find that maximum throughput, or capacity, is a more useful metric. We find that packet losses can reduce server capacity by as much as 50 percent and increase response time as seen by the client. We show that using TCP SACK can reduce client response time, without reducing server capacity.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Blocking in large mobile cellular networks with bursty traffic 01

Blocking in large mobile cellular networks with bursty traff...

引用

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

作者： Nidhi Hegde Khosrow Sohraby Lucent Technologies Bell Laboratories 791 Holmdel-keyport Road Holmdel NJ and Computer Science Telecommunications University of Missouri-Kansas City 5100 Rockhill Road Kansas City MO Computer Science Telecommunications University of Missouri-Kansas City 5100 Rockhill Road Kansas City MO

ISBN: (纸本)9781581133349

We consider large cellular networks. The traffic entering the network is assumed to be correlated in both space and time. The space dependency captures the possible correlation between the arrivals to different nodes in the network, while the time dependency captures the time correlation between arrivals to each node. We model such traffic with a Markov-Modulated Poisson Process(MMPP).It is shown that even in the single node environment, the problem is not mathematically tractable. A model with an infinite number of circuits is used to approximate the finite model. A novel recursive methodology is introduced in finding the joint moments of the number of busy circuits in different cells in the network leading to accurate determination of blocking probability. A simple mixed-Poisson distribution is introduced as an accurate approximation of the distribution of the number ofbusy *** show that for certain cases, in the system with an infinite number of circuits in each cell, there is no effect of mobility on the performance of the system. Our numerical results indicate that the traffic burstiness has a major impact on the system performance. The mixed-Poisson approximation is found to be a very good fit to the exact finite model. The performance of this approximation using few moments is affected by traffic burstiness and average load. We find that in a reasonable range of traffic burstiness, the mixed-Poisson distribution provides a close approximation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

What TCP/IP protocol headers can tell us about the web 01

What TCP/IP protocol headers can tell us about the web

引用

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

作者： F. Donelson Smith Félix Hernández Campos Kevin Jeffay David Ott University of North Carolina at Chapel Hill Department of Computer Science Chapel Hill NC

ISBN: (纸本)9781581133349

We report the results of a large-scale empirical study of web traffic. Our study is based on over 500 GB of TCP/IP protocol-header traces collected in 1999 and 2000 (approximately one year apart) from the high-speed link connecting The University of North Carolina at Chapel Hill to its Internet service provider. We also use a set of smaller traces from the NLANR repository taken at approximately the same times for comparison. The principal results from this study are: (1) empirical data suitable for constructing traffic generating models of contemporary web traffic, (2) new characterizations of TCP connection usage showing the effects of HTTP protocol improvement, notably persistent connections (e.g., about 50% of web objects are now transferred on persistent connections), and (3) new characterizations of web usage and content structure that reflect the influences of "banner ads," server load balancing, and content distribution. A novel aspect of this study is a demonstration that a relatively light-weight methodology based on passive tracing of only TCP/IP headers and off-line analysis tools can provide timely, high quality data about web traffic. We hope this will encourage more researchers to undertake on-going data collection and provide the research community with data about the rapidly evolving characteristics of web traffic.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Characterizing the memory behavior of Java workloads: a structured view and opportunities for optimizations 01

Characterizing the memory behavior of Java workloads: a stru...

引用

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

作者： Yefim Shuf Mauricio J. Serrano Manish Gupta Jaswinder Pal Singh Computer Science Department Princeton University Princeton NJ and IBM T. J. Watson Research Center P. O. Box 218 Yorktown Heights NY Intel Microprocessor Research Labs 2200 Mission College Blvd. Santa Clara CA and IBM T.J. Watson Research Center IBM T. J. Watson Research Center P. O. Box 218 Yorktown Heights NY Computer Science Department Princeton University Princeton NJ

ISBN: (纸本)9781581133349

This paper studies the memory behavior of important Java workloads used in benchmarking Java Virtual Machines (JVMs), based on instrumentation of both application and library code in a state-of-the-art JVM, and provides structured information about these workloads to help guide systems' design. We begin by characterizing the inherent memory behavior of the benchmarks, such as information on the breakup of heap accesses among different categories and on the hotness of references to fields and methods. We then provide detailed information about misses in the data TLB and caches, including the distribution of misses over different kinds of accesses and over different methods. In the process, we make interesting discoveries about TLB behavior and limitations of data prefetching schemes discussed in the literature in dealing with pointer-intensive Java codes. Throughout this paper, we develop a set of recommendations to computer architects and compiler writers on how to optimize computer systems and system software to run Java programs more efficiently. This paper also makes the first attempt to compare the characteristics of SPECjvm98 to those of a server-oriented benchmark, pBOB, and explain why the current set of SPECjvm98 benchmarks may not be adequate for a comprehensive and objective evaluation of JVMs and just-in-time (JIT) *** discover that the fraction of accesses to array elements is quite significant, demonstrate that the number of "hot spots" in the benchmarks is small, and show that field reordering cannot yield significant performance gains. We also show that even a fairly large L2 data cache is not effective for many Java benchmarks. We observe that instructions used to prefetch data into the L2 data cache are often squashed because of high TLB miss rates and because the TLB does not usually have the translation information needed to prefetch the data into the L2 data cache. We also find that co-allocation of frequently used method tables can redu

关键词：

来源：评论

学校读者我要写书评

暂无评论

Proceedings: acm SIGMETRICS '2000 international conference on measurement and modeling of computer systems

Proceedings: ACM SIGMETRICS '2000 International Conference o...

引用

Proceedings acm SIGMETRICS 2000

This Volume 28 of the conference proceedings contains 39 papers. Topics discussed include network architecture and protocols, file and storage systems, web and multimedia servers, networking: congestion control, network measurement and performance modeling, queueing and performance evaluation techniques, tools and benchmarking, memory management and databases and network routing.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs 00

Feasibility of a serverless distributed file system deployed...

引用

international conference on measurement and modeling of computer systems (acm SIGMETRICS 2000)

作者： Bolosky, WJ Douceur, JR Ely, D Theimer, M Microsoft Corp Res Redmond WA 98052 USA

ISBN: (纸本)1581131941

We consider an architecture for a serverless distributed file system that does not assume mutual trust among the client computers. The system provides security, availability, and reliability by distributing multiple encrypted replicas of each file among the client machines. To assess the feasibility of deploying this system on an existing desktop infrastructure, we measure and analyze a large set of client machines in st commercial environment. In particular, we measure and report results on disk usage and content;file activity;and machine uptimes, lifetimes, and loads. We conclude that the measured desktop infrastructure would passably support our proposed system, providing availability on the order of one unfilled file request per user per thousand days.

关键词： serverless distributed file system architecture personal computer usage data availability reliability security trust workload characterization analytical modeling feasibility analysis

来源：评论

学校读者我要写书评

暂无评论

Quantifying the energy consumption of a pocket computer and a Java virtual machine 00

Quantifying the energy consumption of a pocket computer and ...

引用

international conference on measurement and modeling of computer systems (acm SIGMETRICS 2000)

作者： Farkas, KI Flinn, J Back, G Grunwald, D Anderson, JM Compaq Comp Corp Western Res Lab Palo Alto CA 94301 USA

ISBN: (纸本)1581131941

In this paper, we examine the energy consumption of a state-of-the-art packed computer. Using a data acquisition system, we measure the energy consumption of the Itsy Pocket computer, developed by Compaq computer Corporation's Pale Alto Research Labs. We begin by showing that the energy usage characteristics of the Itsy differ markedly from that of a notebook computer. Then, since we expect that flexible software environments will become increasingly prevalent on pocket computers, we consider applications running in a Java environment. In particular, we explain some of the Java design tradeoffs applicable to pocket computers, and quantify their energy costs. For the design options we considered and the three workloads we studied, we find a maximum change in energy use of 25%.

关键词： Laptop computers

来源：评论

学校读者我要写书评

暂无评论

Detecting shared congestion of flows via end-to-end measurement 00

Detecting shared congestion of flows via end-to-end measurem...

引用

international conference on measurement and modeling of computer systems (acm SIGMETRICS 2000)

作者： Rubenstein, D Kurose, J Towsley, D Univ Massachusetts Dept Comp Sci Amherst MA 01003 USA

ISBN: (纸本)1581131941

Current Internet congestion control protocols operate independently on a per-flow basis. Recent work has demonstrated that cooperative congestion control strategies between flows can improve performance for a variety of applications, ranging from aggregated TCP transmissions to multiple-sender multicast applications. However, in order for this cooperation to be effective, one must first identify the flows that are congested at the same set of resources. In this paper, Re present techniques based on loss or delay observations at end-hosts to infer whether or not two flows experiencing congestion are congested at the same network resources. We validate these techniques via queueing analysis, simulation, and experimentation within the Internet.

关键词： Congestion control (communication)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 72 73 74 75 76 77 78 79 80 81 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：