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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

22 篇 会议
4 篇 期刊文献

馆藏范围

26 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

12 篇 工学
- 7 篇 计算机科学与技术...
- 7 篇 软件工程
- 3 篇 电气工程
- 3 篇 船舶与海洋工程
- 2 篇 土木工程
- 1 篇 信息与通信工程
- 1 篇 控制科学与工程
- 1 篇 网络空间安全
3 篇 理学
- 2 篇 海洋科学
- 1 篇 数学

主题

6 篇 throughput
4 篇 operating system...
4 篇 workstations
4 篇 distributed comp...
4 篇 local area netwo...
3 篇 computer archite...
3 篇 bandwidth
3 篇 file servers
3 篇 costs
3 篇 protocols
3 篇 computer network...
3 篇 delay
3 篇 robustness
2 篇 file systems
2 篇 fddi
2 篇 internet protoco...
2 篇 high-speed netwo...
2 篇 application soft...
2 篇 network servers
2 篇 intelligent netw...

机构

7 篇 distributed syst...
2 篇 distributed syst...
2 篇 distributed syst...
2 篇 in the polaris m...
2 篇 distributed syst...
2 篇 as an instructor...
1 篇 distributed syst...
1 篇 department of co...
1 篇 distributed syst...
1 篇 distributed syst...
1 篇 distributed syst...
1 篇 distributed syst...
1 篇 office and teamw...
1 篇 computer science...
1 篇 server performan...
1 篇 department of co...
1 篇 department of co...
1 篇 distributed syst...
1 篇 distributed syst...
1 篇 department of co...

作者

11 篇 k.k. ramakrishna...
7 篇 ramakrishnan k.k...
4 篇 h. yang
2 篇 w.r. hawe
2 篇 k. ravindran
2 篇 yang henry
2 篇 ramakrishnan kk
2 篇 brower ks
1 篇 comstock en
1 篇 walker kw
1 篇 kant k
1 篇 kenneth s. browe...
1 篇 emer js
1 篇 iyer r
1 篇 r. iyer
1 篇 kehoe jw
1 篇 emer joel s.
1 篇 hawe william r.
1 篇 edward n. comsto...
1 篇 s.t. chanson

语言

26 篇 英文

检索条件"机构=Distributed Systems Architecture and Performance"

共 26 条记录，以下是1-10 订阅

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

详细简洁

排序：

A framework for classifying peer-to-peer technologies

A framework for classifying peer-to-peer technologies

引用

2nd IEEE/ACM International Symposium on Cluster Computing and the Grid

作者： Kant, K Iyer, R Tewari, V Server Performance Architecture Enterprise Architecture Lab Intel Corporation OR United States Distributed Systems Architecture Distributed Systems Lab Intel Corporation OR United States

ISBN: (纸本)0769515827

Popularized by Napster and Gnutella file sharing solutions, peer-to-peer (P2P) computing has suddenly emerged at the forefront of Internet computing. The basic notion of cooperative computing and resource sharing has been around for quite some time, although these new applications have opened up possibilities of very flexible web-based information sharing. This article provides a framework for classifying current and future P2P technologies. The main motivation for the classification is to identify basic characteristics of P2P applications so that the infrastructure to support P2P computing can concentrate on these basic characteristics.

关键词： peer-to-peer computing distributed systems network-of-workstations taxonomy file sharing cycle sharing

来源：评论

学校读者我要写书评

暂无评论

A Framework for Classifying Peer-to-Peer Technologies 02

A Framework for Classifying Peer-to-Peer Technologies

引用

IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID)

作者： K. Kant R. Iyer V. Tewari Server Performance Architecture Enterprise Architecture Laboratory Intel Corporation OR USA Distributed Systems Architecture Distributed Systems Laboratory Intel Corporation OR USA

ISBN: (纸本)9780769515823

Popularized by Napster and Gnutella file sharing solutions, peer-to-peer (P2P) computing has suddenly emerged at the forefront of Internet computing. The basic notion of cooperative computing and resource sharing has been around for quite some time, although these new applications have opened up possibilities of very flexible web-based information sharing. This article provides a frame-work for classifying current and future P2P technologies. The main motivation for the classification is to identify basic characteristics of P2P applications so that the infrastructure to support P2P computing can concentrate on these basic characteristics.

关键词： Peer to peer computing distributed computing Computer architecture File servers Internet Digital audio players Web server Time sharing computer systems Resource management Application software

来源：评论

学校读者我要写书评

暂无评论

The Ethernet capture effect: analysis and solution

The Ethernet capture effect: analysis and solution

引用

Conference on Local Computer Networks (LCN)

作者： K.K. Ramakrishnan H. Yang Distributed Systems Architecture and Performance Digital Equipment Corporation Littleton MA USA

We analyze the behavior of the Ethernet in networks with a small number of active stations, and describe what is known as the Ethernet capture effect. Where a station transmits consecutive packets exclusively for a prolonged period despite other stations contending for access. The capture effect causes transient unfairness, which results in substantial performance degradation. We report measurements using TCP/IP that show the performance degradation. A solution is proposed that effectively overcomes the capture effect. The proposed algorithm, which we call the capture avoidance binary exponential backoff (CABEB), uses the standard binary exponential backoff (BEB) with enhancements for collision resolution in the special case when a station attempts to capture the channel subsequent to an uninterrupted consecutive transmit. Using a detailed simulation, we show the efficacy of the CABEB algorithm over the standard BEB in overcoming the unfairness resulting from stations capturing the channel. The CABEB improves throughput for protocols like TCP/IP, reduces variability in the channel access latency and eliminates packet discards due to excessive collisions in a 2-node network. The algorithm is a modification that is compliant with the Ethernet/802.3 standards. For networks with a large number of active stations, the CABEB performs as well as the standard BEB algorithm. Our study placer emphasis on the workload and network configuration that is the worst case relative to the Ethernet capture effect to show that the proposed algorithm is a substantial improvement over the existing backoff algorithm.< >

关键词： Ethernet networks Degradation Network servers Computer networks performance analysis Throughput Access protocols Delay Spine Robustness

来源：评论

学校读者我要写书评

暂无评论

Trace driven analysis of write caching policies for disks 93

Trace driven analysis of write caching policies for disks

引用

1993 ACM SIGMETRICS Conference on Measurement and Modeling of Computer systems, SIGMETRICS 1993

作者： Biswas, Prabuddha Ramakrishnan, K.K. Towsley, Don Office and Teamware Engineering Group Digital Equipment Corporation 110 Spitbrook Road NashuaNH United States Distributed Systems Architecture and Performance Group Digital Equipment Corporation 550 King Street LittletonMA United States Computer Science Department University of Massachusetts AmherstMA United States

ISBN: (纸本)0897915801

The I/O subsystem in a computer system is becoming the bottleneck as a result of recent dramatic improvements in processor speeds. Disk caches have been effective in closing this gap but the benefit is restricted to the read operations as the write I/Os are usually committed to disk to maintain consistency and to allow for crash recovery. As a result, write I/O traffic is becoming dominant and solutions to alleviate this problem are becoming increasingly important. A simple solution which can easily work with existing file systems is to use non-volatile disk caches together with a write-behind strategy. In this study, we look at the issues around managing such a cache using a detailed trace driven simulation. Traces from three different commercial sites are used in the analysis of various policies for managing the write cache. We observe that even a simple write-behind policy for the write cache is effective in reducing the total number of writes by over 50%. We further observe that the use of hysteresis in the policy to purge the write cache, with two thresholds, yields substantial improvement over a single threshold scheme. The inclusion of a mechanism to piggyback blocks from the write cache with read miss I/Os further reduces the number of writes to only about 15% of the original total number of write operations. We compare two piggybacking options and also study the impact of varying the write cache size. We briefly looked at the case of a single non-volatile disk cache to estimate the performance impact of statically partitioning the cache for reads and writes. © 1993 ACM.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SCHEDULING ISSUES FOR INTERFACING TO HIGH-SPEED NETWORKS

SCHEDULING ISSUES FOR INTERFACING TO HIGH-SPEED NETWORKS

引用

GLOBAL TELECOMMUNICATIONS CONF ( GLOBECOM 92 ) , INCLUDING COMMUNICA TIONS THEORY MINI-CONF

作者： RAMAKRISHNAN, KK Distributed Systems Architecture and Performance Digital Equipment Corporation 550 King Street Littleton MA United States

ISBN: (纸本)0780306082

Network speeds are increasing rapidly. The higher bandwidths for communication links available now, ranging from 100 Mbits/sec to Gbits/sec present considerable potential for distributed applications. However, the processing speeds of intermediate systems and host end-systems connected to the network span a wide range, based on cost considerations and the need for older systems to remain connected to the network. Newer systems have processing speeds that are increasing rapidly. This has come about because of advances in caching and technology allowing higher clock speeds. Memory technology however, has not scaled up as rapidly. This has resulted in the ultimate throughput delivered to the user application at endsystems to not increase as rapidly. Network I/O at the end system is becoming the bottleneck. In addition, due to cost and other considerations, intermediate systems are being designed for a wide range of performance targets. Providing connectivity is often an important consideration, even though the system may not be able to meet the worst case performance requirements, based on the characteristics of the links that the system is connected to. Therefore, behavior of the system on the network under overload is increasingly important. We show that a straightforward design of the schedulers on the adapter and the host operating system make a system prone to receive livelocks, significantly increase receive latency, potentially starve transmission of packets and increase packet loss. Receive Livelocks and starvation of transmission of packets can have wide-ranging consequences in the network. When looking at it from an endsystem perspective, transport protocols can unnecessarily timeout, and cause retransmissions. At an intermediate system, these problems can result in control packets not being transmitted in a timely manner. Several of these problems are attributable to poor scheduling algorithms based on interrupts and priorities, which are unsuitable in an ov

关键词： HIgh speed networks

来源：评论

学校读者我要写书评

暂无评论

performance issues in the design of network interfaces for high speed networks

Performance issues in the design of network interfaces for h...

引用

1992 IEEE Workshop on the architecture and Implementation of High performance Communication Subsystems, HPCS 1992

作者： Ramakrishnan, K.K. Hawe, William R. Distributed Systems Architecture and Performance Digital Equipment Corporation 550 King Street LittletonMA01460 United States

来源：评论

学校读者我要写书评

暂无评论

Scheduling issues for interfacing to high speed networks

Scheduling issues for interfacing to high speed networks

引用

[Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE

作者： K.K. Ramakrishnan Distributed Systems Architecture and Performance Digital Equipment Corporation Littleton MA USA

It is shown that a straightforward design of the schedulers on the adapter and the host operating system makes a system prone to receive livelocks, significantly increases receive latency, potentially starves transmission of packets, and increases packet loss. Receive livelocks and starvation of transmission of packets can have wide-ranging consequences in the network. When viewed from an endsystem perspective, transport protocols can unnecessarily time-out, and cause retransmissions. For an intermediate system, these problems can result in control packets not being transmitted in a timely manner. Several of these problems are attributable to poor scheduling algorithms based one interrupts and priorities, which are unsuitable in an overloaded environment. That several of these problems are due to the traditional way of scheduling communications is shown by means of a measurement study on an end system. An approach to scheduling communication functions which would alleviate, if not eliminate, these problems is outlined.< >

关键词： High-speed networks Bandwidth Costs Throughput Scheduling Clocks Operating systems Delay Propagation losses Transport protocols

来源：评论

学校读者我要写书评

暂无评论

performance issues in the design of network interfaces for high speed networks

Performance issues in the design of network interfaces for h...

引用

IEEE Workshop on the architecture and Implementation of High performance Communication Subsystems

作者： K.K. Ramakrishnan W.R. Hawe Distributed Systems Architecture and Performance Digital Equipment Corporation Littleton MA USA

来源：评论

学校读者我要写书评

暂无评论

A Naming system for feature-based service specification in distributed operating systems 91

A Naming system for feature-based service specification in d...

引用

1991 ACM SIGSMALL/PC Symposium on Small systems, SIGSMALL 1991

作者： Ravindran, K. Ramakrishnan, K.K. Department of Computer and Information Sciences Kansas State University ManhattanKS66506 United States Distributed Systems Architecture and Performance Digital Equipment Corporation LittletonMA01460 United States

ISBN: (纸本)0897913965

The paper describes a naming system that allows a service to evolve or reconfigure in functionality by adding and removing features and still co-exist with its previous versions. The underlying naming model has two aspects: (1) (***, ***) pair bssed characterization of service features which allows the meta information on a service to be represented as a collection of such pairs (as in X.500 and Universal Naming Protocol). At low level, the name server provides parse and match operations on the (attribute, vstue) pairs using which high level name bhding operations, viz., name registration and name resolution, are constructed. (2) Data-driven communication paradigm which enables different versions of a client and server to communicate with one another. In this paradigm, a server matches the attributes requested by a client with those it supports, and invokes service specific functions named by the attributes. Since attributes refer to orthogonal features, client and server can evolve independently by adding or removing attributes and still communicate. With this model of specifying services, name server functions may be factorized from service specific functions and implemented in a generic fashion in terms of parse and match operations and function invocations. The paper also describes language support for the naming system and implementation issues. © 1991 ACM.

关键词： distributed database systems

来源：评论

学校读者我要写书评

暂无评论

A ring Purger for the FDDI token ring 16

A ring Purger for the FDDI token ring

引用

16th Conference on Local Computer Networks, LCN 1991

作者： Yang, Henry Ramakrishnan, K.K. Distributed Systems Architecture and Performance Digital Equipment Corporation 550 King Street LitdetonMA01460 United States

ISBN: (纸本)0818623705

The Fiber distributed Data Interface (FDDI) is a 100 Mb/s token ring which includes extensive reliability and robustness mechanisms to provide fault detection, isolation, monitoring, and recovery functions. We examine two well-known problems on token rings and their potential impact on FDDI. The two problems are No-Owner Frame (NOF) and duplicate tokens. FDDI effectively resolves these problems only when either the NOF or the duplicate token collides into a transmitting station. The impact of NOFs and duplicate tokens during the period from the occurrence of the NOF and the duplicate token until they are removed by a transmitting station can be severe. This paper presents a Ring Purger that transparently and continuously removes the NOFs and detects and removes duplicate tokens. A Ring Purger is a designated station on a ring that performs its normal functions as a station and, in addition, performs the removal of NOFs and duplicate tokens. A distributed election algorithm is used to elect a single station on a given ring to be the Ring Purger. It ensures that the ring has one and only one Ring Purger most of the time. The selection of a Ring Purger causes no disruption to the ring operation. A Ring Purger continuously performs purge operations to clean the ring of NOFs and long fragments. It also continuously detects duplicate token condition. Once a duplicate token condition is detected, the Ring Purger initializes the ring to remove the duplicate token. We also present performance and robustness considerations used in the design of the Ring Purger algorithms. We study the performance effect of continuously purging the ring and show that the effect is negligible even in the worst case. © 1991 IEEE.

关键词： Internet protocols

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共3页 << < 1 2 3 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：