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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

9,285 篇 会议
362 篇 期刊文献
31 册 图书
1 篇 学位论文

馆藏范围

9,679 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

4,567 篇 工学
- 4,176 篇 计算机科学与技术...
- 2,156 篇 软件工程
- 848 篇 电气工程
- 638 篇 信息与通信工程
- 313 篇 控制科学与工程
- 227 篇 电子科学与技术（可...
- 83 篇 网络空间安全
- 65 篇 机械工程
- 56 篇 石油与天然气工程
- 55 篇 材料科学与工程（可...
- 52 篇 仪器科学与技术
- 50 篇 生物医学工程（可授...
- 40 篇 动力工程及工程热...
- 34 篇 生物工程
- 32 篇 建筑学
- 31 篇 安全科学与工程
- 29 篇 环境科学与工程（可...
- 28 篇 力学（可授工学、理...
- 27 篇 土木工程
- 26 篇 光学工程
1,073 篇 理学
- 862 篇 数学
- 129 篇 统计学（可授理学、...
- 125 篇 系统科学
- 101 篇 物理学
- 48 篇 生物学
- 34 篇 化学
808 篇 管理学
- 626 篇 管理科学与工程(可...
- 296 篇 工商管理
- 220 篇 图书情报与档案管...
71 篇 经济学
- 68 篇 应用经济学
22 篇 法学
22 篇 医学
18 篇 农学
16 篇 文学
10 篇 教育学
6 篇 军事学
1 篇 艺术学

主题

1,212 篇 distributed data...
993 篇 distributed comp...
954 篇 parallel process...
780 篇 concurrent compu...
779 篇 computer science
695 篇 databases
617 篇 computer archite...
586 篇 application soft...
553 篇 computational mo...
463 篇 parallel process...
369 篇 scalability
358 篇 distributed comp...
352 篇 distributed proc...
327 篇 hardware
325 篇 database systems
294 篇 processor schedu...
294 篇 costs
293 篇 parallel program...
291 篇 resource managem...
269 篇 fault tolerance

机构

32 篇 ibm thomas j. wa...
20 篇 school of comput...
19 篇 oak ridge natl l...
15 篇 college of compu...
13 篇 oak ridge nation...
13 篇 oak ridge nation...
13 篇 pacific northwes...
12 篇 iit dept comp sc...
12 篇 lawrence berkele...
12 篇 argonne national...
12 篇 mathematics and ...
11 篇 department of co...
11 篇 georgia institut...
11 篇 department of co...
11 篇 mathematics and ...
11 篇 department of co...
11 篇 department of co...
11 篇 lawrence berkele...
10 篇 school of comput...
10 篇 lawrence berkele...

作者

21 篇 a. choudhary
15 篇 boukerche azzedi...
13 篇 dongarra jack
13 篇 sun xian-he
11 篇 hoefler torsten
11 篇 s.k. das
11 篇 jack dongarra
11 篇 kurt rothermel
10 篇 choudhary a
9 篇 raicu ioan
9 篇 jun zhang
9 篇 m. takizawa
9 篇 yong chen
9 篇 ciprian dobre
9 篇 l.r. welch
9 篇 welch lonnie r.
9 篇 t. kurc
9 篇 chen haibo
9 篇 florin pop
9 篇 cameron kirk w.

语言

9,640 篇 英文
21 篇 中文
18 篇 其他

检索条件"任意字段=International Symposium on Databases in Parallel and Distributed Systems"

共 9679 条记录，以下是231-240 订阅

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

详细简洁

排序：

distributed Stochastic Bandits with Corrupted and Defective Input Commands

Distributed Stochastic Bandits with Corrupted and Defective ...

引用

2023 IEEE international symposium on Information Theory, ISIT 2023

作者： Chang, Meng-Che Bloch, Matthieu R. Georgia Institute of Technology School of Electrical and Computer Engineering AtlantaGA30332 United States

ISBN: (纸本)9781665475549

We analyze a distributed stochastic bandit model in which an agent controls multiple independent stochastic bandit machines. At each time step, the agent selects several machines for parallel exploitation but the arm pulled by each machine may differ from the command received either randomly (defective command) or adversarially (corrupted command). Machines that faithfully execute commands are called honest. We study situations in which the number of honest machines is either known or unknown and define appropriate notions of regret. With at least one honest machine and a known number of honest bandits, we provide a simple algorithm that achieves Õ( n1/2) regrets when commands are corrupted. Lower bounds on regret established by drawing connections to the problem of "low probability of detection,"show the near optimality of the regret achieved by the algorithms. © 2023 IEEE.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Adaptive Prefetching for Fine-grain Communication in PGAS Programs

Adaptive Prefetching for Fine-grain Communication in PGAS Pr...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Thomas B. Rolinger Alan Sussman NVIDIA Austin TX USA University of Maryland College Park MD USA

ISBN: (数字)9798350387117

ISBN: (纸本)9798350387124

Applications that require distributed-memory systems and exhibit irregular memory access patterns present both productivity and performance challenges. This is largely due to the fine-grain communication that arises from irregular memory accesses to distributed data. The Partitioned Global Address Space (PGAS) model provides a globally shared address space and one-sided communication, making it well suited for implementing irregular codes. However, while the PGAS model provides productivity advantages, irregular applications have difficulty achieving high performance due to the cost of fine-grain remote accesses. One way to improve the performance of such PGAS programs is to prefetch remote data before it is needed, thereby hiding communication latency. The challenges of applying prefetching are computing the prefetch distance (i.e., how far ahead to issue prefetches), determining when prefetching will be profitable, and modifying the program to perform prefetching. In this work, we present an adaptive prefetching optimization that can be applied to PGAS programs with irregular memory access patterns. We target the Chapel parallel programming language, which implements a PGAS model. Our optimization leverages runtime information to adjust the prefetch distance and to pause/resume prefetching when that is likely to provide performance gains. Furthermore, we develop compiler support to automatically apply the optimization without requiring user intervention. We evaluate the optimization across five different distributed-memory systems and four workloads. We observe runtime speed-ups of 0.5 – 377x for the Chapel workloads when compared to not prefetching, and 3 – 215x when compared to implementations written in UPC, OpenSHMEM, and one-sided MPI.

关键词： Productivity distributed processing Runtime parallel programming Prefetching Memory management distributed databases

来源：评论

学校读者我要写书评

暂无评论

Extending the Mochi Methodology to Enable Dynamic HPC Data Services

Extending the Mochi Methodology to Enable Dynamic HPC Data S...

引用

IEEE international symposium on parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Matthieu Dorier Philip Carns Robert Ross Shane Snyder Rob Latham Amal Gueroudji George Amvrosiadis Chuck Cranor Jerome Soumagne Argonne National Laboratory Carnegie Mellon University Intel Corporation

ISBN: (数字)9798350364606

ISBN: (纸本)9798350364613

High-performance computing (HPC) applications and workflows are increasingly making use of custom data services to complement traditional parallel file systems with fast transient data management capabilities tailored to application-specific needs. In the Mochi project we provide methodologies and tools that enable rapid development of custom HPC data services, including a collection of composable software components that can be combined to build complex distributed data services. Our initial version of Mochi targeted data services deployed with static configurations with a fixed number of nodes and minimal fault tolerance. However, there is a growing need for dynamic services that can adapt while running in response to changing workloads and system conditions. In this paper we present our work to extend the Mochi architecture to support the development of dynamic data services. We achieve this by providing new Mochi components that support unified bootstrapping and online reconfiguration, fault detection, monitoring, and consensus. We also provide a methodology for deriving service-wide resilience from the resilience of each of the service's components.

关键词： Productivity High performance computing distributed databases Authentication Software Encryption Security

来源：评论

学校读者我要写书评

暂无评论

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy! 36

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensu...

引用

36th IEEE international parallel and distributed Processing symposium (IEEE IPDPS)

作者： Civit, Pierre Gilbert, Seth Gramoli, Vincent Guerraoui, Rachid Komatovic, Jovan Sorbonne Univ LIP6 CNRS Paris France NUS Singapore Singapore Singapore Univ Sydney EPFL Sydney NSW Australia Ecole Polytech Fed Lausanne EPFL Lausanne Switzerland

ISBN: (纸本)9781665481069

It is known that the agreement property of the Byzantine consensus problem among n processes can be violated in a non-synchronous system if the number of faulty processes exceeds t(0) = left perpendicularn/3right perpendicular - 1 [10], [19]. In this paper, we investigate the accountable Byzantine consensus problem in non-synchronous systems: the problem of solving Byzantine consensus whenever possible (e.g., when the number of faulty processes does not exceed t(0)) and allowing correct processes to obtain proof of culpability of (at least) t(0) + 1 faulty processes whenever correct processes disagree. We present four complementary contributions: 1) We introduce ABC: a simple yet efficient transformation of any Byzantine consensus protocol to an accountable one. ABC introduces an overhead of only two all-toall communication rounds and O(n(2)) additional bits in executions with up to t(0) faults (i.e., in the common case). 2) We define the accountability complexity, a complexity metric representing the number of accountabilityspecific messages that correct processes must send. Furthermore, we prove a tight lower bound. In particular, we show that any accountable Byzantine consensus protocol incurs cubic accountability complexity. Moreover, we illustrate that the bound is tight by applying the ABC transformation to any Byzantine consensus protocol. 3) We demonstrate that, when applied to an optimal Byzantine consensus protocol, ABC constructs an accountable Byzantine consensus protocol that is (1) optimal with respect to the communication complexity in solving consensus whenever consensus is solvable, and (2) optimal with respect to the accountability complexity in obtaining accountability whenever disagreement occurs. 4) We generalize ABC to other distributed computing problems besides the classic consensus problem. We characterize a class of agreement tasks, including reliable and consistent broadcast [5], that ABC renders accountable.

关键词： Measurement distributed processing Lattices Complexity theory Consensus protocol Reliability Task analysis

来源：评论

学校读者我要写书评

暂无评论

HiPS2022: The 2nd Workshop on High Performance Serverless Computing 22

HiPS2022: The 2nd Workshop on High Performance Serverless Co...

引用

31st international symposium on High-Performance parallel and distributed Computing (HPDC)

作者： Babuji, Yadu Chard, Kyle Foster, Ian Li, Zhuozhao Argonne Natl Lab Argonne IL 60439 USA Southern Univ Sci & Technol Shenzhen Peoples R China

ISBN: (纸本)9781450391993

Serverless computing presents an attractive model for general distributed computing as it focuses on abstracting the infrastructure required to execute an application. This workshop investigates the intersection between high performance computing and serverless computing, looking both at the high performance and distributed systems used to deliver serverless platforms and also at the use of serverless models for high performance and distributed systems.

关键词： Cloud Computing Serverless distributed systems

来源：评论

学校读者我要写书评

暂无评论

INODE - Intelligence Open Data Exploration 4

INODE - Intelligence Open Data Exploration

引用

4th international Workshop on systems and Network Telemetry and Analytics (SNTA)

作者： Stockinger, Kurt Zurich Univ Appl Sci Winterthur Switzerland

This article describes the keynote speech on INODE presented at Fourth international Workshop on systems and Network Telemetry and Analytics (SNTA) which is collocated with international ACM symposium on High -Perform... 详细信息

ISBN: (纸本)9781450383868

关键词： Natural language interfaces to databases knowledge graph generation question answering query processing.

来源：评论

学校读者我要写书评

暂无评论

Latency-Redundancy Tradeoff in distributed Read-Write systems 14

Latency-Redundancy Tradeoff in Distributed Read-Write System...

引用

14th international Conference on COMmunication systems and NETworkS, COMSNETS 2022

作者： Ramanathan, Saraswathy Gautam, Gaurav Srinivasan, Vikram Parag, Parimal Indian Institute of Science Dept. of Electrical Communication Engineering Bangalore560012 India

ISBN: (纸本)9781665421041

Data is replicated and stored redundantly over multiple servers for availability in distributed databases. We focus on databases with frequent reads and writes, where both read and write latencies are important. This is in contrast to databases designed primarily for either read or write applications. Redundancy has contrasting effects on read and write latency. Read latency can be reduced by potential parallel access from multiple servers, whereas write latency increases as a larger number of replicas have to be updated. We quantify this tradeoff between read and write latency as a function of redundancy, and provide a closed-form approximation when the request arrival is Poisson and the service is memoryless under prioritized reads. We empirically show that this approximation is tight across all ranges of system parameters. Thus, we provide guidelines for redundancy selection in distributed databases. © 2022 IEEE.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Toward Ultra-large Scale Neural Spike Sorting with distributed Sorting Channels and Unsupervised Training

Toward Ultra-large Scale Neural Spike Sorting with Distribut...

引用

IEEE international symposium on Circuits and systems (ISCAS)

作者： Sun, Junhong Li, Tianhao Guo, Tongtong Li, Yongfu Fu, Changyun Liu, Yan Shanghai Jiao Tong Univ Dept Micronano Elect Shanghai Peoples R China

ISBN: (纸本)9781665484855

Brain machine interface systems will require recording thousands of neural channels in parallel to acquire large scale neuronal activity. High bandwidth action potential signal will overload the data communication bandwidth, and on-site spike sorting can extract essential information, however, requires extensive computational resources to achieve high classification accuracy. This demands for high resources consuming, especially in large-scale real-time sorting systems. In this work, a customized unsupervised training engine incorporated with distributed and optimized sorting channels is presented in order to reduce the hardware complexity without compromising the accuracy of spike sorting. A mixed-domain feature set is extracted in each channel, followed by feature based sorting. Each channel will constantly monitor the sorting accuracy and will request training engine intervention when in need. The proposed system is implemented in a 180 nm CMOS process, consuming only 0.33 mu W/channel with a clock of 25 kHz and power supply of 1.8 V, and in-channel sorting occupies 0.0023 mm(2), with training engines occupying 1.956 mm(2), which can be shared by all the channels.

关键词： Neural spike sorting unsupervised training feature extraction

来源：评论

学校读者我要写书评

暂无评论

parallel Implementation of SHA256 on Multizone Heterogeneous systems 21

Parallel Implementation of SHA256 on Multizone Heterogeneous...

引用

21st IEEE international symposium on parallel and distributed Processing with Applications, 13th IEEE international Conference on Big Data and Cloud Computing, 16th IEEE international Conference on Social Computing and Networking and 13th international Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Luo, Yongtao Liu, Jie Xiao, Tiaojie Gong, Chunye National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory Laboratory of Digitizing Program for Frontier Equipment Changsha China National Supercomputer Center in Tianjin Tianjin China

ISBN: (纸本)9798350329223

SHA-256 plays an important role in widely used applications, such as data security, data integrity, digital signatures, and cryptocurrencies. However, most of the current optimized implementations of SHA-256 are based on CPUs or dedicated hardware, such as ASICs and FPGAs. Consequently, there is a need to explore whether new heterogeneous parallel framework can improve the computational performance of the hash function. To address this issue, we conducted a study on the MT-3000 platform, which is a special architecture processor for the next-generation exascale prototype supercomputer. We proposed MT-SHA256, a heterogeneous multistage parallel implementation for hashing multiple messages on the MT-3000. Combining the architectural features of this processor, we developed an effective solution that significantly improved the computational performance of SHA-256. As a result, MT-SHA256 achieved a maximum throughput of 1045.68 MB/s on a single acceleration core of MT-3000. This is 9.84x higher than the C code implementation on one CPU core of MT-3000. We also performed a scalability test and found that MT-SHA256 achieved a throughput of 98.04 GB/s on a computing node, and extended to 512 nodes (2048 acceleration clusters) on this system with good scalability. © 2023 IEEE.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Control plane systems tracing and debugging - towards implementation 20

Control plane systems tracing and debugging - towards implem...

引用

20th international symposium on parallel and distributed Computing (ISPDC)

作者： Peregud, Gleb Ganzha, Maria Paprzycki, Marcin Warsaw Univ Technol Dept Math & Informat Sci Warsaw Poland Polish Acad Sci Syst Res Inst Warsaw Poland

ISBN: (纸本)9781665432818

Reasoning about, and debugging, hierarchical control plane systems is hard. Moreover, OpenTracing, the industry adopted tracing model, has problems with tracing activities in presence of coalescing effects, which materialize, among others, in cloud platforms and build systems. In our earlier work we have proposed a novel approach to distributed systems tracing, based on an extension of OpenTracing. The aim of this contribution is to outline how the proposed approach can be implemented.

关键词： control plane systems OpenTracing coalescing effects distributed systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 20 21 22 23 24 25 26 27 28 29 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：