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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

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

馆藏范围

1,015 篇 电子文献
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

语言

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

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

共 1015 条记录，以下是691-700 订阅

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

详细简洁

排序：

Scalability of multicast delivery for non-sequential streaming access

Scalability of multicast delivery for non-sequential streami...

引用

acm SIGMETRICS 2002 international conference on measurement and modeling of computer systems

作者： Jin, Shudong Bestavros, Azer Computer Science Department Boston University Boston MA 02215 United States

To serve asynchronous requests using multicast, two categories of techniques-stream merging and periodic broadcasting-have been proposed. For sequential streaming access, where requests are uninterrupted from the beginning to the end of an object, these techniques are highly scalable;the required server bandwidth for stream merging grows logarithmically as request arrival rate, and the required server bandwidth for periodic broadcasting varies logarithmically as the inverse of start-up delay. A sequential access model, however, is inappropriate to model partial requests and client inter-activity observed in various streaming access workloads. This paper analytically and experimentally studies the scalability of multicast delivery under a non-sequential access model where requests start at random points in the object. We show that the required server bandwidth for any protocol providing immediate service grows at least as the square root of request arrival rate, and the required server bandwidth for any protocol providing delayed service grows linearly with the inverse of start-up delay. We also investigate the impact of limited client receiving bandwidth on scalability. We optimize practical protocols which provide immediate service to non-sequential requests. The protocols utilize limited client receiving bandwidth, and they are near-optimal in that the required server bandwidth is very close to its lower bound.

关键词： Data communication systems

来源：评论

学校读者我要写书评

暂无评论

Characterizing the d-TLB behavior of SPEC CPU2000 benchmarks

Characterizing the d-TLB behavior of SPEC CPU2000 benchmarks

引用

acm SIGMETRICS 2002 international conference on measurement and modeling of computer systems

作者： Kandiraju, Gokul B. Sivasubramaniam, Anand Dept. of Computer Science and Eng. The Pennsylvania State University University Park PA 16802 United States

Despite the numerous optimization and evaluation studies that have been conducted with TLBs over the years, there is still a deficiency on an indepth understanding of TLB characteristics from an application angle. This paper presents a detailed characterization study of the TLB behavior of the SPEC CPU2000 benchmark suite. The contributions of this work are in identifying important application characteristics for TLB studies, quantifying the SPEC2000 application behavior for these characteristics, as well as making pronouncements and suggestions for future research based on these results. Around one-fourth of the SPEC2000 applications (ammp, apsi, galgel, lucas, mcf, twolf and vpr) have significant TLB miss-rates. Both capacity and associativity are influencing factors on miss-rates, though they do not necessarily go hand-in-hand. Multi-level TLBs are definitely useful for these applications in cutting down access times without significant miss rate degradation. Superpaging to combine TLB entries may not be rewarding for many of these applications. Software management of TLBs in terms of determining what entries to prefetch, what entries to replace, and what entries to pin has a lot of potential to cut down miss rates considerably. Specifically, the potential benefits of prefetching TLB entries is examined, and Distance Prefetching is shown to give good prediction accuracy for these applications.

关键词： Response time (computer systems)

来源：评论

学校读者我要写书评

暂无评论

Energy consumption of TCP Reno, Newreno, and SACK in multi-hop wireless networks

Energy consumption of TCP Reno, Newreno, and SACK in multi-h...

引用

acm SIGMETRICS 2002 international conference on measurement and modeling of computer systems

作者： Singh, Harkirat Singh, Suresh Department of Computer Science Portland State University Portland OR 97207 United States

In this paper we compare the energy consumption behavior of three versions of TCP - Reno, Newreno, and SACK. The experiments were performed on a wireless testbed where we measured the energy consumed at the sender node. Our results indicate that, in most cases, using total energy consumed as the metric, SACK out-performs Newreno and Reno while Newreno performs better than Reno. The experiments emulated a large set of network conditions including variable round trip times, random loss, bursty loss, and packet reordering. We also estimated the idealized energy for each of the three implementations (i.e., we subtract out the energy consumed when the sender is idle) and here, surprisingly, we find that in many instances SACK performs poorly compared to the other two implementations. We conclude that if the mobile device has a very low idle power consumption then SACK is not the best implementation to use for bursty or random loss. On the other hand, if the idle power consumption is significant, then SACK is the best choice since it has the lowest overall energy consumption.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

Limits of wide-area thin-client computing

Limits of wide-area thin-client computing

引用

acm SIGMETRICS 2002 international conference on measurement and modeling of computer systems

作者： Lai, Albert Nieh, Jason Department of Computer Science Columbia University 1214 Amsterdam Avenue MC0401 New York NY 10027-7003 United States

While many application service providers have proposed using thin-client computing to deliver computational services over the Internet, little work has been done to evaluate the effectiveness of thin-client computing in a wide-area network. To assess the potential of thin-client computing in the context of future commodity high-bandwidth Internet access, we have used a novel, non-invasive slow-motion benchmarking technique to evaluate the performance of several popular thin-client computing platforms in delivering computational services cross-country over Internet2. Our results show that using thin-client computing in a wide-area network environment can deliver acceptable performance over Internet2, even when client and server are located thousands of miles apart on opposite ends of the country. However, performance varies widely among thin-client platforms and not all platforms are suitable for this environment. While many thin-client systems are touted as being bandwidth efficient, we show that network latency is often the key factor in limiting wide-area thin-client performance. Furthermore, we show that the same techniques used to improve bandwidth efficiency often result in worse overall performance in wide-area networks. We characterize and analyze the different design choices in the various thin-client platforms and explain which of these choices should be selected for supporting wide-area computing services.

关键词： Client server computer systems

来源：评论

学校读者我要写书评

暂无评论

Inferring client response time at the web server

Inferring client response time at the web server

引用

acm SIGMETRICS 2002 international conference on measurement and modeling of computer systems

作者： Olshefski, David P. Nieh, Jason Agrawal, Dakshi IBM T.J. Watson Research Hawthorne NY United States Columbia University New York NY United States

As businesses continue to grow their World Wide Web presence, it is becoming increasingly vital for them to have quantitative measures of the client perceived response times of their web services. We present Certes (CliEnt Response Time Estimated by the Server), an online server-based mechanism for web servers to measure client perceived response time, as if measured at the client. Certes is based on a model of TCP that quantifies the effect that connection drops have on perceived client response time, by using three simple server-side measurements: connection drop rate, connection accept rate and connection completion rate. The mechanism does not require modifications to http servers or web pages, does not rely on probing or third party sampling, and does not require client-side modifications or scripting. Certes can be used to measure response times for any web content, not just HTML. We have implemented Certes and compared its response time measurements with those obtained with detailed client instrumentation. Our results demonstrate that Certes provides accurate server-based measurements of client response times in HTTP 1.0/1.1 [14] environments, even with rapidly changing workloads. Certes runs online in constant time with very low overhead. It can be used at web sites and server farms to verify compliance with service level objectives.

关键词： Client server computer systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic statistical profiling of communication activity in distributed applications

Dynamic statistical profiling of communication activity in d...

引用

acm SIGMETRICS 2002 international conference on measurement and modeling of computer systems

作者： Vetter, Jeffrey Ctr. for Appl. Scientific Computing Lawrence Livermore National Lab. Livermore CA 94551 United States

Performance analysis of communication activity for a terascale application with traditional message tracing can be overwhelming in terms of overhead, perturbation, and storage. We propose a novel alternative that enables dynamic statistical profiling of an application's communication activity using message sampling. We have implemented an operational prototype, named Photon, and our evidence shows that this new approach can provide an accurate, low-overhead, tractable alternative for performance analysis of communication activity. Photon consists of two components: a Message Passing Interface (MPI) profiling layer that implements sampling and analysis, and a modified MPI runtime that appends a small but necessary amount of information to individual messages. More importantly, this alternative enables an assortment of runtime analysis techniques so that, in contrast to post-mortem, trace-based techniques, the raw performance data can be jettisoned immediately after analysis. Our investigation shows that message sampling can reduce overhead to imperceptible levels for many applications. Experiments on several applications demonstrate the viability of this approach. For example, with one application, our technique reduced the analysis overhead from 154% for traditional tracing to 6% for statistical profiling. We also evaluate different sampling techniques in this framework. The coverage of the sample space provided by purely random sampling is superior to counter- and timer-based sampling. Also, Photon's design reveals that frugal modifications to the MPI runtime system could facilitate such techniques on production computing systems, and it suggests that this sampling technique could execute continuously for long-running applications.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A case for exploiting self-similarity of network traffic in TCP congestion control

A case for exploiting self-similarity of network traffic in ...

引用

10th IEEE international conference on Network Protocols, ICNP 2002

作者： He, Guanghui Gao, Yuan Hou, Jennifer C. Park, Kiliong Dept. of Computer Science Univ. of IIlinois at Urbana Champaign Urbana IL 61801 United States Dept of Computer Science Purdue University West Lafayette IN 47907 United States

ISBN: (纸本)0769518567

Analytical and empirical studies have shown that self-similar traffic can have a detrimental impact on network performance including amplified queuing delay and packet loss ratio. On the flip side, the ubiquity of scale-invariant burstiness observed across diverse networking contexts can be exploited to design better resource control algorithms. We explore the issue of exploiting the self-similar characteristics of network traffic in TCP congestion control. We show that the correlation structure present in long-range dependent traffic can be detected on-line and used to predict future traffic. We then devise an novel scheme, called TCP with traffic prediction (TCP-TP), that exploits the prediction result to infer, in the context of AIMD (additive increase, multiplicative decrease) steady-state dynamics, the optimal operational point for a TCP connection. Through analytical reasoning, we show that the impact of prediction errors on fairness is minimal. We also conduct ns-2 simulation and FreeBSD 4.1-based implementation studies to validate the design and to demonstrate the performance improvement in terms of packet loss ratio and throughput attained by connections. © 2002 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Improving cluster availability using workstation validation

Improving cluster availability using workstation validation

引用

acm SIGMETRICS 2002 international conference on measurement and modeling of computer systems

作者： Heath, Taliver Martin, Richard P. Nguyen, Thu D. Department of Computer Science Rutgers University 110 Frelinghuysen Rd. Piscataway NJ 08854 United States

We demonstrate a framework for improving the availability of cluster based Internet services. Our approach models Internet services as a collection of interconnected components, each possessing well defined interfaces and failure semantics. Such a decomposition allows designers to engineer high availability based on an understanding of the interconnections and isolated fault behavior of each component, as opposed to ad-hoc methods. In this work, we focus on using the entire commodity workstation as a component because it possesses natural, fault-isolated interfaces. We define a failure event as a reboot because not only is a workstation unavailable during a reboot, but also because reboots are symptomatic of a larger class of failures, such as configuration and operator errors. Our observations of 3 distinct clusters show that the time between reboots is best modeled by a Weibull distribution with shape parameters of less than 1, implying that a workstation becomes more reliable the longer it has been operating. Leveraging this observed property, we design an allocation strategy which withholds recently rebooted workstations from active service, validating their stability before allowing them to return to service. We show via simulation that this policy leads to a 70-30 rule-of-thumb: For a constant utilization, approximately 70% of the workstation failures can be masked from end clients with 30% extra capacity added to the cluster, provided reboots are not strongly correlated. We also found our technique is most sensitive to the burstiness of reboots as opposed to absolute lengths of workstation uptimes.

关键词： Internet

来源：评论

学校读者我要写书评

暂无评论

Admission control and dynamic adaptation for a proportional-delay DiffServ-enabled web server

Admission control and dynamic adaptation for a proportional-...

引用

acm SIGMETRICS 2002 international conference on measurement and modeling of computer systems

作者： Lee, Sam C. M. Lui, John C. S. Yau, David K. Y. Chinese University of Hong Kong Purdue University West Lafayette IN United States

We consider a web server that can provide differentiated services to clients with different QoS requirements. The web server can provide N > 1 classes of service. Rather than using a strict priority policy, which may lead to request starvation, the web server provides a proportional-delay differentiated service (PDDS) to heterogeneous clients. An operator for the web server can specify "fixed" performance spacings between classes, namely, ri,i+1 > 1, for i = 1,..., N - 1. Requests in class i + 1 are guaranteed to have an average waiting time which is 1/ri,i+1 of the average waiting time of class i requests. With PDDS, we can provide consistent performance spacings over a wide range of system loadings. In addition, each client can specify a maximum average waiting time requirement to be guaranteed by the web server. We propose two efficient admission control algorithms so that a web server can provide the QoS guarantees and, at the same time, classify each client to its "lowest" admissible class, resulting in lowest usage cost for the client. We also consider how to perform end-point dynamic adaptation such that clients can submit requests at a lower class and further reduce their usage cost, without violating their QoS requirements. We propose two dynamic adaptation algorithms: one is server-based and the other is client-based. The client-based adaptation is based on a non-cooperative game technique. We report diverse experimental results to illustrate the effectiveness of these algorithms.

关键词： Client server computer systems

来源：评论

学校读者我要写书评

暂无评论

LIRS: An efficient low inter-reference recency set replacement policy to improve buffer cache performance

LIRS: An efficient low inter-reference recency set replaceme...

引用

acm SIGMETRICS 2002 international conference on measurement and modeling of computer systems

作者： Jiang, Song Zhang, Xiaodong Department of Computer Science College of William and Mary Williamsburg VA 23187-8795 United States

Although LRU replacement policy has been commonly used in the buffer cache management, it is well known for its inability to cope with access patterns with weak locality. Previous work, such as LRU-K and 2Q, attempts to enhance LRU capacity by making use of additional history information of previous block references other than only the recency information used in LRU. These algorithms greatly increase complexity and/or can not consistently provide performance improvement. Many recently proposed policies, such as UBM and SEQ, improve replacement performance by exploiting access regularities in references. They only address LRU problems on certain specific and well-defined cases such as access patterns like sequences and loops. Motivated by the limits of previous studies, we propose an efficient buffer cache replacement policy, called Low Inter-reference Recency Set (LIRS). LIRS effectively addresses the limits of LRU by using recency to evaluate Inter-Reference Recency (IRR) for making a replacement decision. This is in contrast to what LRU does: directly using recency to predict next reference timing. At the same time, LIRS almost retains the same simple assumption of LRU to predict future access behavior of blocks. Our objectives are to effectively address the limits of LRU for a general purpose, to retain the low overhead merit LRU, and to outperform those replacement policies relying on the access regularity detections. Conducting simulations with a variety of traces and a wide range of cache sizes, we show that LIRS significantly outperforms LRU, and outperforms other existing replacement algorithms in most cases. Furthermore, we show that the additional cost for implementing LIRS is trivial in comparison with LRU.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 66 67 68 69 70 71 72 73 74 75 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：