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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

modeling communication pipeline latency 98

Modeling communication pipeline latency

引用

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

作者： Randolph Y. Wang Arvind Krishnamurthy Richard P. Martin Thomas E. Anderson David E. Culler Computer Science Division University of California Berkeley Department of Computer Science and Engineering University of Washington Seattle

ISBN: (纸本)9780897919821

In this paper, we study how to minimize the latency of a message through a network that consists of a number of store-and-forward stages. This research is especially relevant for today's low overhead communication systems that employ dedicated processing elements for protocol processing. We develop an abstract pipeline model that reveals a crucial performance tradeoff involving the effects of the overhead of the bottleneck stage and the bandwidth of the remaining stages. We exploit this tradeoff to develop a suite of fragmentation algorithms designed to minimize message latency. We also provide an experimental methodology that enables the construction of customized pipeline algorithms that can adapt to the specific system characteristics and application workloads. By applying this methodology to the Myrinet-GAM system, we have improved its latency by up to 51%. Our theoretical framework is also applicable to pipelined systems beyond the context of high speed networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The impact of I/O on program behavior and parallel scheduling 98

The impact of I/O on program behavior and parallel schedulin...

引用

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

作者： Emilia Rosti Giuseppe Serazzi Evgenia Smirni Mark S. Squillante Dipartimento di Scienze dell'Informazione Università degli Studi di Milano Milano Italy Dipartimento di Elettronica e Informazione Politecnico di Milano Milano Italy Department of Computer Science College of William and Mary Williamsburg VA IBM Research Division T. J. Watson Research Center Yorktown Heights NY

ISBN: (纸本)9780897919821

In this paper we systematically examine various performance issues involved in the coordinated allocation of processor and disk resources in large-scale parallel computer systems. Models are formulated to investigate the I/O and computation behavior of parallel programs and workloads, and to analyze parallel scheduling policies under such workloads. These models are parameterized by measurements of parallel programs, and they are solved via analytic methods and simulation. Our results provide important insights into the performance of parallel applications and resource management strategies when I/O demands are not negligible.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Predicting MPEG execution times 98

Predicting MPEG execution times

引用

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

作者： Andy C. Bavier A. Brady Montz Larry L. Peterson Department of Computer Science The University of Arizona Tucson AZ

ISBN: (纸本)9780897919821

This paper reports on a set of experiments that measure the amount of CPU processing needed to decode MPEG-compressed video in software. These experiments were designed to discover indicators that could be used to predict how many cycles are required to decode a given frame. Such predictors can be used to do more accurate CPU scheduling. We found that by considering both frame type and size, it is possible to construct a linear model of MPEG decoding with R2 values of 0.97 and higher. Moreover, this model can be used to predict decoding times at both the frame and packet level that are almost always accurate to within 25% of the actual decode times. This is a surprising result given the large variability in MPEG decoding times, and suggests that it is feasible to design systems that make quality of service guarantees for MPEG-encoded video.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LoGPC: modeling network contention in message-passing programs 98

LoGPC: modeling network contention in message-passing progra...

引用

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

作者： Csaba Andras Moritz Matthew I. Frank Laboratory for Computer Science Massachusetts Institute of Technology Cambridge Massachusetts

ISBN: (纸本)9780897919821

In many real applications, for example those with frequent and irregular communication patterns or those using large messages, network contention and contention for message processing resources can be a significant part of the total execution time. This paper presents a new cost model, called LoGPC, that extends the LogP [9] and LogGP [4] models to account for the impact of network contention and network interface DMA behavior on the performance of message-passing *** validate LoGPC by analyzing three applications implemented with Active Messages [11, 18] on the MIT Alewife multiprocessor. Our analysis shows that network contention accounts for up to 50% of the total execution time. In addition, we show that the impact of communication locality on the communication costs is at most a factor of two on Alewife. Finally, we use the model to identify tradeoffs between synchronous and asynchronous message passing styles.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Transient loss performance of a class of finite buffer queueing systems 98

Transient loss performance of a class of finite buffer queue...

引用

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

作者： Guang-Liang Li Jun-Hong Cui Bo Li Fang-Ming Li Department of Computer Science Hong Kong University of Science & Technology Clear water Bay Kowloon Hong Kong P. R. China Institute of Computing Technology Academia Sinica P.O. Box 2704-25 Beijing 100080 P. R. China

ISBN: (纸本)9780897919821

Performance-oriented studies typically rely on the assumption that the stochastic process modeling the phenomenon of interest is already in steady state. This assumption is, however, not valid if the life cycle of the phenomenon under study is not large enough, since usually a stochastic process cannot reach steady state unless time evolves towards infinity. Therefore, it is important to address performance issues in transient *** work in transient analysis of queueing systems usually focuses on Markov models. This paper, in contrast, presents an analysis of transient loss performance for a class of finite buffer queueing systems that are not necessarily Markovian. We obtain closed-form transient loss performance measures. Based on the loss measures, we compare transient loss performance against steady-state loss performance and examine how different assumptions on the arrival process will affect transient loss behavior of the queueing system. We also discuss how to guarantee transient loss performance. The analysis is illustrated with numerical results.

关键词： stochastic modeling transient loss performance queueing systems

来源：评论

学校读者我要写书评

暂无评论

Scheduling with implicit information in distributed systems 98

Scheduling with implicit information in distributed systems

引用

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

作者： Andrea C. Arpaci-Dusseau David E. Culler Alan M. Mainwaring Computer Science Division University of California Berkeley

ISBN: (纸本)9780897919821

Implicit coscheduling is a distributed algorithm for time-sharing communicating processes in a cluster of workstations. By observing and reacting to implicit information, local schedulers in the system make independent decisions that dynamically coordinate the scheduling of communicating processes. The principal mechanism involved is two-phase spin-blocking: a process waiting for a message response spins for some amount of time, and then relinquishes the processor if the response does not *** this paper, we describe our experience implementing implicit coscheduling on a cluster of 16 UltraSPARC I workstations; this has led to contributions in three main areas. First, we more rigorously analyze the two-phase spin-block algorithm and show that spin time should be increased when a process is receiving messages. Second, we present performance measurements for a wide range of synthetic benchmarks and for seven Split-C parallel applications. Finally, we show how implicit coscheduling behaves under different job layouts and scaling, and discuss preliminary results for achieving fairness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A methodology and an evaluation of the SGI Origin2000 98

A methodology and an evaluation of the SGI Origin2000

引用

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

作者： Dongming Jiang Jaswinder Pal Singh Department of Computer Science Princeton University Princeton NJ

ISBN: (纸本)9780897919821

As hardware-coherent, distributed shared memory (DSM) multiprocessing becomes popular commercially, it is important to evaluate modern realizations to understand how they perform and scale for a range of interesting applications and to identify the nature of the key bottlenecks. This paper evaluates the SGI Origin2000---the machine that perhaps has the most aggressive communication architecture of the recent cache-coherent offerings---and, in doing so, articulates a sound methodology for evaluating real systems. We examine data access and synchronization microbenchmarks; speedups for different application classes, problem sizes and scaling models; detailed interactions and time breakdowns using performance tools; and the impact of special hardware support. We find that overall the Origin appears to deliver on the promise of cache-coherent shared address space multiprocessing, at least at the 32-processor scale we examine. The machine is quite easy to program for performance and has fewer organizational problems than previous systems we have examined. However, some important trouble spots are also identified, especially related to contention that is apparently caused by engineering decisions to share resources among processors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cello: a disk scheduling framework for next generation operating systems 98

Cello: a disk scheduling framework for next generation opera...

引用

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

作者： Prashant J. Shenoy Harrick M. Vin Distributed Multimedia Computing Laboratory Department of Computer Sciences University of Texas at Austin Taylor Hall 2.124 Austin Texas

ISBN: (纸本)9780897919821

In this paper, we present the Cello disk scheduling framework for meeting the diverse service requirements of applications. Cello employs a two-level disk scheduling architecture, consisting of a class-independent scheduler and a set of class-specific schedulers. The two levels of the framework allocate disk bandwidth at two time-scales: the class-independent scheduler governs the coarse-grain allocation of bandwidth to application classes, while the class-specific schedulers control the fine-grain interleaving of requests. The two levels of the architecture separate application-independent mechanisms from application-specific scheduling policies, and thereby facilitate the co-existence of multiple class-specific schedulers. We demonstrate that Cello is suitable for next generation operating systems since: (i) it aligns the service provided with the application requirements, (ii) it protects application classes from one another, (iii) it is work-conserving and can adapt to changes in work-load, (iv) it minimizes the seek time and rotational latency overhead incurred during access, and (v) it is computationally efficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Performance measurements for multithreaded programs 98

Performance measurements for multithreaded programs

引用

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

作者： Minwen Ji Edward W. Felten Kai Li Department of Computer Science Princeton University Princeton NJ

ISBN: (纸本)9780897919821

Multithreaded programming is an effective way to exploit concurrency, but it is difficult to debug and tune a highly threaded program. This paper describes a performance tool called Tmon for monitoring, analyzing and tuning the performance of multithreaded programs. The performance tool has two novel features: it uses "thread waiting time" as a measure and constructs thread waiting graphs to show thread dependencies and thus performance bottlenecks, and it identifies "semi-busy-waiting" points where CPU cycles are wasted in condition checking and context switching. We have implemented the Tmon tool and, as a case study, we have used it to measure and tune a heavily threaded file system. We used four workloads to tune different aspects of the file system. We were able to improve the file system bandwidth and throughput significantly. In one case, we were able to improve the bandwidth by two orders of magnitude.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Task assignment in a distributed system (extended abstract): improving performance by unbalancing load 98

Task assignment in a distributed system (extended abstract):...

引用

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

作者： Mark E. Crovella Mor Harchol-Balter Cristina D. Murta Department of Computer Science Boston University Boston MA Laboratory for Computer Science MIT NE43-340 Cambridge MA

ISBN: (纸本)9780897919821

We consider the problem of task assignment in a distributed system (such as a distributed Web server) in which task sizes are drawn from a heavy-tailed distribution. Many task assignment algorithms are based on the heuristic that balancing the load at the server hosts will result in optimal performance. We show this conventional wisdom is less true when the task size distribution is heavy-tailed (as is the case for Web file sizes). We introduce a new task assignment policy, called Size Interval Task Assignment with Variable Load (SITA-V). SITA-V purposely operates the server hosts at different loads, and directs smaller tasks to the lighter-loaded hosts. The result is that SITA-V provably decreases the mean task slowdown by significant factors (up to 1000 or more) where the more heavy-tailed the workload, the greater the improvement factor. We evaluate the tradeoff between improvement in slowdown and increase in waiting time in a system using SITA-V, and show conditions under which SITA-V represents a particularly appealing policy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：