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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

182 篇 期刊文献
127 篇 会议
1 册 图书
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

290 篇 工学
- 258 篇 计算机科学与技术...
- 96 篇 电气工程
- 87 篇 软件工程
- 24 篇 信息与通信工程
- 7 篇 电子科学与技术（可...
- 5 篇 控制科学与工程
- 3 篇 机械工程
- 2 篇 仪器科学与技术
- 1 篇 力学（可授工学、理...
- 1 篇 动力工程及工程热...
- 1 篇 石油与天然气工程
- 1 篇 网络空间安全
21 篇 理学
- 13 篇 数学
- 4 篇 物理学
- 4 篇 化学
- 2 篇 系统科学
11 篇 管理学
- 11 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...
2 篇 教育学
- 2 篇 心理学(可授教育学...
1 篇 文学

主题

311 篇 distributed shar...
15 篇 distributed comp...
13 篇 distributed syst...
13 篇 multiprocessors
12 篇 operating system...
12 篇 synchronization
11 篇 performance eval...
11 篇 cluster computin...
10 篇 performance
9 篇 memory consisten...
9 篇 cache coherence
8 篇 scalability
8 篇 mpi
8 篇 algorithms
8 篇 causal consisten...
8 篇 sequential consi...
7 篇 message passing
7 篇 false sharing
7 篇 design
7 篇 multiprocessor

机构

9 篇 technion israel ...
6 篇 natl cheng kung ...
4 篇 univ politecn ma...
4 篇 wayne state univ...
4 篇 natl cheng kung ...
4 篇 mit comp sci lab...
3 篇 natl kaohsiung u...
3 篇 univ siena siena
3 篇 cornell univ com...
3 篇 tokyo city univ ...
3 篇 univ hong kong d...
3 篇 univ politecn ca...
3 篇 rice univ dept c...
3 篇 univ calif irvin...
3 篇 univ rochester d...
2 篇 univ utah sci co...
2 篇 evidence srl pis...
2 篇 inria alice grp ...
2 篇 univ wisconsin d...
2 篇 tech univ munich...

作者

9 篇 shieh ck
7 篇 giorgi roberto
6 篇 liang ty
5 篇 schuster a
5 篇 heinrich m
5 篇 friedman r
5 篇 shieh ce-kuen
5 篇 mac sc
5 篇 liang tyng-yeu
4 篇 chaudhary v
4 篇 oro david
4 篇 yokoyama takanor...
4 篇 wang cl
4 篇 rizzo antonio
4 篇 bal he
4 篇 demsky brian
4 篇 jimenez-gonzalez...
4 篇 bueno javier
4 篇 ueng jc
4 篇 martorell xavier

语言

296 篇 英文
14 篇 其他
1 篇 中文

检索条件"主题词=distributed shared memory"

共 311 条记录，以下是51-60 订阅

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

详细简洁

排序：

Emulating FCFSOQ with Buffered Crossbar based distributed shared memory switch

Emulating FCFSOQ with Buffered Crossbar based distributed sh...

引用

Workshop on High Performance Switching and Routing

作者： Hua, Nan Xu, Yang Liu, Bin Jin, Depeng Zeng, Lieguang Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China

ISBN: (纸本)9781424412051

Emulating Output Queued (OQ) Switch with sustainable implementation cost and low fixed delay is always preferable in high performance router design. distributed shared memory (DSM) Switch, also called Switch-memory-Switch (SMS) router, provides a promising way towards emulating OQ in backbone switches. However, the previous architectures and algorithms for DSM/SMS switches require either high implementation cost or iterations of scheduling. This paper proposes a Buffered Crossbar based DSM switch (BC-DSM), which can emulate the FCFS OQ based on a speedup-two buffered crossbar. Each crosspoint has only two packet buffers, one for arrival packet and one for departure packet. Different with previous works of DSM, we do not aim to resolve memory access conflicts when packets arrive, but to randomly dispatch packets into memories through buffered crossbar and resolve departure conflicts by bounded small queueing and delay. For scheduling, the departure packets are prioritized in the transferring between the fabric and the memory. The advantages of our scheme include: 1) Only N two-speedup memories and one two-speedup buffered N x N crossbar are needed. 2) Scheduling process is simple and distributive, thanks to buffered crossbar. 3) No need for additional crosspoint buffer for overcoming long Round-Trip Time (RTT), thanks to the probabilistic load-balancing scheme. 4) Simulation shows that only a few fixed delay is needed to provide extremely low packet loss rate such as 10(-8), under different types of traffic patterns, including bursty model and unbalanced model.

关键词： Buffered Crossbar distributed shared memory BC-DSM switch-memory-switch emulating FCFSOQ

来源：评论

学校读者我要写书评

暂无评论

FaaSPipe: Fast Serverless Workflows on distributed shared memory 19th

FaaSPipe: Fast Serverless Workflows on Distributed Shared Me...

引用

19th International Conference on Network and Parallel Computing (NPC)

作者： Tong, Ruizhe Shanghai Jiao Tong Univ Shanghai Peoples R China

ISBN: (纸本)9783031213946;9783031213953

Serverless workflows consist of multiple chained functions that pass intermediate data through function invocations. Existing platforms implement data passing via remote storage services that incur significant performance and maintenance overhead. Some recent works optimize data passing with local shared memory but require specialized function scheduling support and are available only in constrained settings. In this paper, we observed that a simplified, peer-to-peer form of distributed shared memory (DSM) is sufficient and efficient to pass data in serverless workflows. With the observation, we propose FaaSPipe, a serverless workflow runtime built on the simplified DSM. FaaSPipe provides PipeFunc, a user-friendly shared memory-based serverless workflow programming model. To support PipeFunc and take full advantage of the simplified DSM, FaaSPipe designs the intra-workflow memory sharing scheme for address space coordination and builds full-duplex memory transfer channels to enable fast, non-blocking peer-to-peer data passing. Evaluation results on real-world workflow applications show that FaaSPipe reduces workflow latency by up to 61% and consumes up to 2.07x less network traffic compared to state-of-art serverless platforms.

关键词： Serverless computing FaaS distributed shared memory

来源：评论

学校读者我要写书评

暂无评论

Toward transparent selective sequential consistency in distributed shared memory systems

Toward transparent selective sequential consistency in Distr...

引用

18th International Conference on distributed Computing Systems

作者： Sun, CZ Huang, ZY Lei, WJ Sattar, A Griffith Univ Sch Comp & Informat Sci Brisbane Qld 4111 Australia

ISBN: (纸本)0780350049

This paper proposes a transparent selective sequential consistency approach to distributed shared memory (DSM) systems. Firsts three basic techniques - time selection, processor. selection, and data selection - are analyzed for improving the performance of strictly sequential consistency DSM systems, and a transparent approach to achieving these selections is proposed. Then, this paper focuses on the protocols and techniques devised to achieve transparent ent data selection, including a novel Selective Lazy/Eager Updates Propagation protocol for propagating updates on shared data objects: and the Critical Region Updated Pages Set scheme to automatically detect the associations between shared data objects and synchronization objects. The proposed approach is able to offer the same potential performance advantages as the Entry Consistency model or the Scope Consistency model, but St imposes no extra burden to programmers and never Jails to Execute programs correctly. The devised protocols and techniques have been implemented and experimented with in the content of the TreadMarks DSM system. Performance results have shown that for many applications, our transparent data selection approach out-performs the Lazy Release Consistency model using a lazy or eager updates propagation protocol.

关键词： distributed shared memory consistency model time selection processor selection data selection selective lazy/eager updates propagation

来源：评论

学校读者我要写书评

暂无评论

A distributed Real-Time Operating System with distributed shared memory for Embedded Control Systems

A Distributed Real-Time Operating System with Distributed Sh...

引用

11th IEEE International Conference on Dependable, Autonomic and Secure Computing (DASC)

作者： Chiba, Takahiro Yoo, Myungryun Yokoyama, Takanori Tokyo City Univ Setagaya Ku Tokyo 1588557 Japan

ISBN: (纸本)9781479933815

The paper presents a distributed real-time operating system (DRTOS) that provides a distributed shared memory (DSM) service for distributed control systems. Model-based design has become popular in embedded control software design and the source code of software modules can be generated from a controller model. The generated software modules exchange their input and output values through shared variables. We develop a DRTOS with a real-time DSM service to provide a location-transparent environment, in which distributed software modules can exchange input and output values through the DSM. The DRTOS is an extension to OSEK OS. We use a real-time network called FlexRay, which is based on a TDMA (Time Division Multiple Access) protocol. The consistency of the DSM is maintained according to the order of data transfer through FlexRay, not using inter-node synchronization. The worst case response time of the DSM is predictable if the FlexRay communication is well configured.

关键词： operating systems real-time systems embedded systems distributed shared memory distributed control systems

来源：评论

学校读者我要写书评

暂无评论

Modelling and model checking a distributed shared memory consistency protocol 19th

引用

19th International Conference on Application and Theory of Petri Nets (ICATPN 98)

作者： Fisler, K Girault, C Rice Univ Dept Comp Sci Houston TX 77005 USA Univ Paris 06 Lab Comp Sci LIP6 F-75252 Paris 05 France

ISBN: (纸本)3540646779

distributed shared memory (DSM) systems provide the abstraction of a common virtual address space across a network of processors. Such systems employ a variety of protocols to maintain a consistent view of data across all local memories. Li and Hudak proposed several of the pioneering protocols for DSM [LH 89]. We have used both Petri net modelling and model checking to explore some of their protocols. Our work has detected inefficiencies, unstated assumptions, and errors in the original protocol descriptions. This paper presents Petri net models for one protocol at two layers of abstraction. For each model, we describe corresponding specifications for model checking and provide verification statistics. This combination of models and specifications gives different views of the protocol, inspiring greater confidence in the correctness of our analysis than if we had used only one approach.

关键词： protocol design and verification distributed shared memory memory consistency model checking high level Petri nets

来源：评论

学校读者我要写书评

暂无评论

A two-stage distributed shared memory architecture and its scheduling algorithms

引用

International Conference on Communication Technology

作者： Peng, Y Dong, YG Wei, JW Guo, YF Natl Digital Switching Syst Engn & Technol R&D Ct Zhengzhou 450002 Peoples R China

ISBN: (纸本)7563506861

The performance of a high-speed router is limited by the random access rate of memories and the switching rate of the Inner switch architecture. This paper proposes a two-stage distributed shared memory architecture (TSDSM) and its scheduling algorithms which tan emulate the FCFS and the PIFO output-queued (OQ) scheduling algorithms. The lower bound of the memories of the TSDSM is analyzed. We also prove that our algorithms can emulate the QQ scheduling algorithms. The most advantage of the TSDSM over other switching architectures is that the access rate of memories is commercially available and the switch can work without speedup.

关键词： switch scheduling output queue distributed shared memory

来源：评论

学校读者我要写书评

暂无评论

Software Transactional distributed shared memory

Software Transactional Distributed Shared Memory

引用

14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

作者： Dash, Alokika Demsky, Brian Univ Calif Irvine Irvine CA 92717 USA

ISBN: (纸本)9781605583976

We have developed a transaction-based approach to distributed shared memory(DSM) that supports object caching and generates path expression prefetches. A path expression specifies a path through the heap that traverses the objects to be prefetched. To our knowledge, this is the first prefetching approach that can prefetch objects whose addresses have not been computed or predicted. Our DSM uses both prefetching and caching of remote objects to hide network latency while relying on the two-phase transaction commit mechanism to preserve the simple transactional consistency model that we present to the developer. We have evaluated this approach on a matrix multiply benchmark. We have found that our approach enables to effectively utilize multiple machines in a cluster and also benefit from prefetching and caching of objects.

关键词： Design Algorithms Transactional memory distributed shared memory Prefetching objects Path-expression prefetch

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Locally-Accessible Implementations for distributed shared memory Multiprocessors

Brief Announcement: Locally-Accessible Implementations for D...

引用

29th ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing

作者： Golab, Wojciech Univ Calgary Dept Comp Sci Calgary AB T2N 1N4 Canada

ISBN: (纸本)9781605588889

We consider asynchronous multiprocessors that support the distributed shared memory (DSM) model. Algorithms for such multiprocessors exploit the ability to co-locate shared objects with particular processes in order to reduce the cost of accessing shared memory. When a shared object fits inside a single memory word and operations on it are supported directly through machine instructions, it can be made local to any process simply by fixing its physical address. We show that even if the shared object is not supported in hardware directly, it can always be simulated using a software implementation that behaves as though it is local to some designated process. That is, operations applied by the designated process on the implemented object access only local base objects, which is non-trivial when processes synchronize by busy-waiting. We also discuss time complexity bounds for such locally-accessible implementations.

关键词： distributed shared memory remote memory references shared objects locally-accessible implementations

来源：评论

学校读者我要写书评

暂无评论

The Designing and Implementing of distributed shared memory

The Designing and Implementing of Distributed Shared Memory

引用

International Conference on Innovative Computing and Communication/Asia-Pacific Conference on Information Technology and Ocean Engineering

作者： Wang Chengduan WeiFang Univ Dept Comp Sci & Technol Weifang Peoples R China

ISBN: (纸本)9780769539423

The distributed shared memory is used to manage the memory in distributed system. In this paper, we have studied the DSM, modified the structure of DSM, and have designed and implemented it. In unstructured DSM, The key issues are the granularity of data, transfers, replication of data, memory consistence, and keeping track of the data throughout the system. In implementing of structured DSM, we have researched DSM with weak consistency, DSM with release or entry consistency, and object-based DSM.

关键词： distributed shared memory Replication Granularity consistency

来源：评论

学校读者我要写书评

暂无评论

Symbolic Prefetching in Transactional distributed shared memory

Symbolic Prefetching in Transactional Distributed Shared Mem...

引用

15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

作者： Dash, Alokika Demsky, Brian Univ Calif Irvine Irvine CA 92717 USA

ISBN: (纸本)9781605587080

We present a static analysis for the automatic generation of symbolic prefetches in a transactional distributed shared memory. A symbolic prefetch specifies the first object to be prefetched followed by a list of field offsets or array indices that define a path through the heap. We also provide an object caching framework and language extensions to support our approach. To our knowledge, this is the first prefetching approach that can prefetch objects whose addresses have not been computed or predicted. Our approach makes aggressive use of both prefetching and caching of remote objects to hide network latency. It relies on the transaction commit mechanism to preserve the simple transactional consistency model that we present to the developer. We have evaluated this approach on several shared memory parallel benchmarks and a distributed gaming benchmark to observe speedups due to prefetching and caching.

关键词： Symbolic prefetching Transactional memory distributed shared memory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共32页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：