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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,338 篇 会议
54 篇 期刊文献
1 册 图书

馆藏范围

1,393 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,075 篇 工学
- 1,034 篇 计算机科学与技术...
- 459 篇 软件工程
- 158 篇 信息与通信工程
- 146 篇 电气工程
- 78 篇 控制科学与工程
- 42 篇 网络空间安全
- 16 篇 电子科学与技术（可...
- 8 篇 化学工程与技术
- 8 篇 农业工程
- 6 篇 仪器科学与技术
- 6 篇 建筑学
- 6 篇 生物工程
- 5 篇 机械工程
- 5 篇 生物医学工程（可授...
- 4 篇 光学工程
- 4 篇 材料科学与工程（可...
297 篇 理学
- 270 篇 数学
- 70 篇 统计学（可授理学、...
- 17 篇 物理学
- 10 篇 系统科学
- 9 篇 化学
- 8 篇 生物学
- 6 篇 大气科学
65 篇 管理学
- 34 篇 图书情报与档案管...
- 33 篇 管理科学与工程(可...
- 23 篇 工商管理
15 篇 教育学
- 15 篇 教育学
13 篇 经济学
- 13 篇 应用经济学
9 篇 法学
- 7 篇 社会学
8 篇 农学
- 8 篇 作物学
1 篇 医学

主题

249 篇 distributed comp...
96 篇 distributed algo...
77 篇 distributed comp...
34 篇 distributed algo...
29 篇 consensus
25 篇 distributed syst...
24 篇 congest model
23 篇 approximation al...
23 篇 computer systems...
23 篇 local model
22 篇 algorithms
21 篇 distributed grap...
20 篇 fault tolerance
19 篇 cloud computing
17 篇 shared memory
16 篇 self-stabilizati...
15 篇 message passing
15 篇 fault-tolerance
14 篇 lower bounds
13 篇 graph algorithms

机构

26 篇 swiss fed inst t...
24 篇 technion haifa
17 篇 mit cambridge ma...
16 篇 univ freiburg fr...
11 篇 tel aviv univ te...
10 篇 univ michigan an...
10 篇 carnegie mellon ...
10 篇 technion dept co...
10 篇 aalto univ espoo
10 篇 natl univ singap...
9 篇 ben gurion univ ...
8 篇 weizmann inst sc...
8 篇 cispa helmholtz ...
8 篇 national univers...
7 篇 ben gurion univ ...
6 篇 ecole polytech f...
6 篇 cnrs
6 篇 univ texas austi...
5 篇 georgetown univ ...
5 篇 aalto university...

作者

24 篇 kuhn fabian
20 篇 ghaffari mohsen
18 篇 suomela jukka
18 篇 censor-hillel ke...
17 篇 raynal michel
17 篇 fraigniaud pierr...
16 篇 elkin michael
15 篇 chang yi-jun
15 篇 pandurangan gopa...
15 篇 brandt sebastian
14 篇 peleg david
14 篇 toueg sam
14 篇 olivetti dennis
14 篇 wattenhofer roge...
14 篇 kutten shay
13 篇 balliu alkida
13 篇 patt-shamir boaz
13 篇 guerraoui rachid
12 篇 rajsbaum sergio
12 篇 maus yannic

语言

1,379 篇 英文
13 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing"

共 1393 条记录，以下是1301-1310 订阅

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

详细简洁

排序：

proceedings of the 11th acm symposium on Operating Systems principles, SOSP 1987

Proceedings of the 11th ACM Symposium on Operating Systems P...

引用

11th acm symposium on Operating Systems principles, SOSP 1987

ISBN: (纸本)089791242X

The proceedings contain 19 papers. The topics discussed include: scale and performance in a distributed file system;caching in the sprite network file system;using idle workstations in a shared computing environment;attacking the process migration bottleneck;hashed and hierarchical timing wheels: data structures for the efficient implementation of a timer facility;the packet filter: an efficient mechanism for user-level network code;a name service for evolving heterogeneous systems;duality of memory and communication in the implementation of a multiprocessor operating system;time warp operating system;synchronization primitives for a multiprocessor: a formal specification;stored voice in the Etherphone system;grained mobility in the Emerald system;management in QuickSilver;801 storage: architecture and programming;implementation of Argus;exploiting virtual synchrony in distributed systems;log files: an extended file service exploiting write-once storage;a simple and efficient implementation of a small database;reimplementing the cedar file system using logging and group commit.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Specifying graceful degradation in distributed systems 87

Specifying graceful degradation in distributed systems

引用

6th Annual acm symposium on principles of distributed computing, PODC 1987

作者： Herlihy, Maurice P. Wing, Jeannette M. Department of Computer Science Carnegie Mellon University PittsburghPA15213-3890 United States

ISBN: (纸本)089791239X

distributed programs must often display graceful degradation, reacting adaptively to changes in the environment. Under ideal circumstances, the program's behavior satisfies a set of application-dependent constraints. In the presence of failures, timing anomalies, or synchronization conflicts, however, certain constraints may become difficult or impossible to satisfy, and the application designer may choose to relax them as long as the resulting behavior is sufficiently "close" to the preferred behavior. This paper describes the relaxation lattice method, a new approach to specifying graceful degradation for a large class of highly-concurrent fault-tolerant distributed programs. A relaxation lattice is a lattice of specifications parameterized by a set of constraints, where the stronger the set of constraints, the more restrictive the specification. While a program is able to satisfy its strongest set of constraints, it satisfies its preferred specification, but if changes to the environment force it to satisfy a weaker set, then it will permit additional "weakly consistent" computations which are undesired but tolerated. The use of relaxation lattices is illustrated by specifications for programs that tolerate (1) faults, such as site crashes and network partitions, (2) timing anomalies, such as attempting to read a value "too soon" after it was written, and (3) synchronization conflicts, such as choosing the oldest "unlocked" item from a queue. © 1987 acm.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

A simple and efficient implementation for small databases 11

A simple and efficient implementation for small databases

引用

11th acm symposium on Operating Systems principles, SOSP 1987

作者： Birrell, Andrew D. Jones, Michael B. Wobber, Edward P. DEC Systems Research Center 130 Lytton Avenue Palo AltoCA94301 United States Carnegie-Mellon University PittsburghPA United States

ISBN: (纸本)089791242X

This paper describes a technique for implementing the sort of small databases that frequently occur in the design of operating systems and distributed systems. We take advantage of the existence of very large virtual memories, and quite large real memories, to make the technique feasible. We maintain the database as a strongly typed data structure in virtual memory, record updates incrementally on disk in a log and occasionally make a checkpoint of the entire database. We recover from crashes by restoring the database from an old checkpoint then replaying the log. We use existing packages to convert between strongly typed data objects and their disk representations, and to communicate strongly typed data across the network (using remote procedure calls). Our memory is managed entirely by a general purpose allocator and garbage collector. This scheme has been used to implement a name server for a distributed system. The resulting implementation has the desirable property of being simultaneously simple, efficient and reliable. © 1987 acm.

关键词： distributed database systems

来源：评论

学校读者我要写书评

暂无评论

Scale and performance in a distributed file system 87

Scale and performance in a distributed file system

引用

11th acm symposium on Operating Systems principles, SOSP 1987

作者： Howard, John H. Kazar, Michael L. Menees, Sherri G. Nichols, David A. Satyanarayanan, M. Sidebotham, Robert N. West, Michael J. Information Technology Center Carnegie Mellon University PittsburghPA15213 United States

ISBN: (纸本)089791242X

Andrew is a distributed computing environment being developed in a joint project by Carnegie Mellon University and IBM. One of the major components of Andrew is a distributed file system which constitutes underlying mechanism for sharing information. The goals of the Andrew file system are to support growth up to at least 7000 workstations (one for each student, faculty member, and staff at Carnegie Mellon) while providing users, application programs, and system administrators with the amenities of a shared file system.A fundamental result of our concern with scale is the design decision to transfer whole files between servers and workstations rather than some smaller unit such as records or blocks, as almost all other distributed file systems do. This paper examines the consequences of this and other design decisions and features that bear on the scalability of *** scale affects a distributed system in two ways: it degrades performance and it complicates administration and day-to-day operation. This paper addresses both concerns and shows that the mechanisms we have incorporated cope with them successfully. We start the initial prototype of the system, what we learned from it, and how we changed the system to improve performance. We compare its performance with that of a block-oriented file system, Sun Microsystems' NFS, in order to evaluate the whole file transfer strategy. We then turn to operability, and finish with issues related peripherally to scale and with the ways the present design could be enchanced.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Specifying message passing systems requires extending temporal logic 87

Specifying message passing systems requires extending tempor...

引用

6th Annual acm symposium on principles of distributed computing, PODC 1987

作者： Koymans, Ron Eindhoven University of Technology Department of Mathematics and Computing Science P.O. Box 513 5600 MB Eindhoven Netherlands

ISBN: (纸本)089791239X

We prove that it is impossible to express asynchronous message passing within the framework of first-order temporal logic with both future and past operators (as studied by Kamp). This is an extension of a result of Sistla et al. that unbounded buffers cannot be expressed in linear time temporal logic. Although strengthening Kamp's logic by adding counting and quantification over occurrences of propositions enables the expression of most message passing systems, we argue that order preserving systems which may lose messages still remain inexpressible. This is caused by the impossibility to couple each message that is delivered by a message passing system to a unique message accepted by that system. These results seem to necessitate the enrichment of TL-based formalisms, e.g. with auxiliary data structures or histories as done, respectively, by Lamport and Hailpern. Observe that Lamport employs a hybrid formalism (TL + Data Structures), and that in Hailpern's method similar systems, such as FIFO and LIFO, do not have similar specifications. We shall prove that no such enrichment is logically required. This is done by introducing an assumption which makes the unique coupling mentioned above possible. This assumption can be formulated in TL. In this way. no extraneous formalisms are introduced, and both FIFO and LIFO are expressible with equal ease. © 1987 acm.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Exploiting virtual synchrony in distributed systems 87

Exploiting virtual synchrony in distributed systems

引用

11th acm symposium on Operating Systems principles, SOSP 1987

作者： Birman, Kenneth P. Joseph, Thomas A. Department of Computer Science Cornell University IthacaNY14853 United States

ISBN: (纸本)089791242X

We describe applications of a virtually synchronous environment for distributed programming, which underlies a collection of distributed programming tools in the ISIS2 system. A virtually synchronous environment allows processes to be structured into process groups, and makes events like broadcasts to the group as an entity, group membership changes, and even migration of an activity from one place to another appear to occur instantaneously - in other words, synchronously. A major advantage to this approach is that many aspects of a distributed application can be treated independently without compromising correctness. Moreover, user code that is designed as if the system were synchronous can often be executed concurrently. We argue that this approach to building distributed and fault-tolerant software is more straightforward, more flexible, and more likely to yield correct solutions than alternative approaches.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

distributed simulation and the time warp operating system 11

Distributed simulation and the time warp operating system

引用

11th acm symposium on Operating Systems principles, SOSP 1987

作者： Jefferson, David Beckman, Brian Wieland, Fred Blume, Leo Di Loreto, Mike Hontalas, Phil Laroche, Pierre Sturdevant, Kathy Tupman, Jack Warren, Van Wedel, John Younger, Herb Bellenot, Steve Jet Propulsion Laboratory United States Florida State University United States

ISBN: (纸本)089791242X

This paper describes the Time Warp Operating System, under development for three years at the Jet Propulsion Laboratory for the Caltech Mark III Hypercube multiprocessor. Its primary goal is concurrent execution of large, irregular discrete event simulations at maximum speed. It also supports any other distributed applications that are synchronized by virtual time. The Time Warp Operating System includes a complete implementation of the Time Warp mechanism, and is a substantial departure from conventional operating systems in that it performs synchronization by a general distributed process rollback mechanism. The use of general rollback forces a rethinking of many aspects of operating system design, including programming interface, scheduling, message routing and queueing, storage management, flow control, and commitment. In this paper we review the mechanics of Time Warp, describe the TWOS operating system, show how to construct simulations in object-oriented form to run under TWOS, and offer a qualitative comparison of Time Warp to the Chandy-Misra method of distributed simulation. We also include details of two benchmark simulations and preliminary measurements of time-to-completion, speedup, rollback rate, and antimessage rate, all as functions of the number of processors used. © 1987 acm.

关键词： Storage management

来源：评论

学校读者我要写书评

暂无评论

proceedings of the Annual acm symposium on principles of distributed computing

Proceedings of the Annual ACM Symposium on Principles of Dis...

引用

5th Annual acm symposium on principles of distributed computing, PODC 1986

ISBN: (纸本)0897911989

The proceedings contain 23 papers. The topics discussed include: concurrent programming for the masses;symmetry and similarity in distributed systems;on the analysis of cooperation and antagonism in networks of communicating processes;on characterization of safety and liveness properties in temporal logic;a model and proof system for asynchronous networks;easy impossibility proofs for distributed consensus problems;optimal clock synchronization;comparing how atomicity mechanisms support replication;site optimal termination protocols for a distributed database under network partitioning;distributed version management for read-only actions;a provably secure polynomial approximation scheme for the distributed lottery problem;and simple constant-time consensus protocols in realistic failure models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Designing a global name service 86

Designing a global name service

引用

5th Annual acm symposium on principles of distributed computing, PODC 1986

作者： Lampson, Butler W. Systems Research Center Digital Equipment Corporation 130 Lytton Avenue Palo AltoCA94301 United States

ISBN: (纸本)0897911989

A name service maps a name of an individual, organization or facility into a set of labelled properties, each of which is a string. It is the basis for resource location, mail addressing, and authentication in a distributed computing system. The global name service described here is meant to do this for billions of names distributed throughout the world. It addresses the problems of high availability, large size, continuing evolution, fault isolation and lack of global trust. The non-deterministic behaviour of the service is specified rather precisely to allow a wide range of client and server implementations. © 1986 acm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Incremental attribute evaluation in distributed language-based environments 86

Incremental attribute evaluation in distributed language-bas...

引用

5th Annual acm symposium on principles of distributed computing, PODC 1986

作者： Kaplan, Simon M. Kaiser, Gail E. University of Illinois Department of Computer Science UrbanaIL61801 United States Columbia University Department of Computer Science New YorkNY10027 United States

ISBN: (纸本)0897911989

We present a model of distributed program editing and algorithms for the incremental checking of static semantic properties of modules that are at once semantically interdependent and physically distributed across a number of workstations connected by a high speed network. This makes possible the synthesis of modern program development hardware - workstations on high speed networks - and modern program development software - incremental, language-baaed program development systems - that until now have suffered from the problem of not being able to support incremental checking across distributed modules. © 1986 acm.

关键词： HIgh speed networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共140页 << < 127 128 129 130 131 132 133 134 135 136 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：