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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
365 篇 期刊文献
33 册 图书
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

4,570 篇 工学
- 4,179 篇 计算机科学与技术...
- 2,156 篇 软件工程
- 849 篇 电气工程
- 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,632 篇 英文
31 篇 其他
21 篇 中文

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

共 9684 条记录，以下是101-110 订阅

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

详细简洁

排序：

NetDS: distributed Search Framework with Hybrid Acceleration Methods 22

NetDS: Distributed Search Framework with Hybrid Acceleration...

引用

22nd IEEE international symposium on parallel and distributed Processing with Applications, ISPA 2024

作者： Zhang, Penghao Hu, Zhiguo Taiyuan China

ISBN: (纸本)9798331509712

Approximate neighbour nearest search has achieved great success for indexing similar high-dimensional data in distributed search systems. As the scale of data vectors grows, distributed search require large storage, low latency, and high throughput on processing vectors. To achieve this, researchers tend to load balance data with more machines and implement efficient distributed frameworks, but they need to pay huge storage overhead, which leads to inefficient network *** address this gap, we propose NetDS, which exploits the computational capacity of in-network computation and the storage capacity of solid-state drives. NetDS utilizes a multi-level constrained balanced tree to process data vectors and construct multi-level tables. Then, NetDS proposes a heuristic neighbour graph to solve the boundary data problem. NetDS also offloads central tables and graphs into switches to accelerate vector classification. Finally, NetDS designs hybrid storage and query pre-match methods to accelerate the ANNS distributed system. We deploy NetDS on a programmable switch and evaluate it. NetDS completes the data and query processing in a shorter time than other typical distributed frameworks. © 2024 IEEE.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

parallel distributed collision avoidance with intention consensus based on ADMM 17

Parallel distributed collision avoidance with intention cons...

引用

17th IFAC symposium on Control of Transportation systems (CTS)

作者： Hoang Anh Tran Johansen, Tor Arne Negenborn, Rudy R. Norwegian Univ Sci & Technol NTNU Dept Engn Cybernet Trondheim Norway Delft Univ Technol Dept Maritime & Transport Technol Delft Netherlands

This paper presents an approach to the problem of collaborative collision avoidance of autonomous inland ships. We propose a distributed model predictive control algorithm that allows ships to negotiate their intention to collaboratively avoid collisions directly. Furthermore, a new method is introduced to better shape ships' behavior in order to follow traffic regulations. The simulation results illustrate that the proposed algorithm could significantly increase ship safety navigation. Moreover, it also shows that the solution proposed by our algorithm complies with waterway traffic regulations except in complex situations when other safe solutions are negotiated. Copyright (C) 2024 The Authors. This is an open access article under the CC BY-NC-ND license (https://***/licenses/by-nc-nd/4.0/)

关键词： Marine Transportation Modeling, Control and Optimization of Transportation systems Connected and Automated Vehicles ADMM Model predictive control

来源：评论

学校读者我要写书评

暂无评论

Balancing Intra-Die and Inter-Die Placement Optimization in 2.5D FPGA Architectures

Balancing Intra-Die and Inter-Die Placement Optimization in ...

引用

1st international Conference on Smart Energy systems and Artificial Intelligence (SESAI)

作者： Raikar, Raveena Stroobandt, Dirk Univ Ghent Ghent Belgium

ISBN: (纸本)9798350364613;9798350364606

Interposer-based 2.5D FPGAs contain multiple dies interconnected through external wires, which introduce higher delay and longer wirelength compared to the interconnection network of a single die. Efficient CAD tools are needed for such architectures to strategically manage signal counts at the die boundary. In this study, we introduce a modular approach for parallel die-level placement, eliminating the need for a time-consuming global placement optimization step. Our methodology uses netlist partitioning and adds virtual anchor blocks to enable parallel die placement and facilitate inter-partition net optimization. Our method results in a multi-die placement tool 'LiquidMD'. Comparing our base multi-die placer with a state-of-the-art tool that fully globally optimizes placement shows substantial runtime improvement with improved placement quality. We also introduce a synchronization strategy for optimizing interpartition nets and assess how minimal synchronization benefits modular parallel placement. Our research results in a modular placement algorithm that strikes a favourable balance between runtime efficiency and placement quality.

关键词： 2.5D architectures Multi-die FPGA placement parallel placement Silicon Interposer

来源：评论

学校读者我要写书评

暂无评论

Fully Dynamic Line Maintenance by Hybrid Programmable Matter 36

Fully Dynamic Line Maintenance by Hybrid Programmable Matter

引用

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

作者： Nokhanji, Nooshin Flocchini, Paola Santoro, Nicola Carleton Univ Sch Comp Sci Ottawa ON Canada Univ Ottawa Sch Elect Engn & Comp Sci Ottawa ON Canada

ISBN: (纸本)9781665497473

Motivated by the manipulation of nanoscale materials, recent investigations have focused on hybrid systems where passive elements incapable of movement, called tiles, are manipulated by one or more mobile entities, called robots, with limited computational capabilities. Like in most self-organizing systems, the fundamental concern is with the (geometric) shapes created by the position of the tiles;among them, the line is perhaps the most important. The existing investigations have focused on formation of the shape, but not on its reconfiguration following the failure of some of the tiles. In this paper, we study the problem of maintaining a line formation in presence of fully dynamic failures: any tile can stop functioning at any time. We show how this problem can be solved by a group of very simple robots, with the computational power of deterministic finite automata.

关键词： Shape formation fault-tolerance hybrid programmable matter line maintenance distributed algorithms self-assembly

来源：评论

学校读者我要写书评

暂无评论

distributed Tracing for InterPlanetary File System 1

Distributed Tracing for InterPlanetary File System

引用

1st international symposium on parallel Computing and distributed systems, PCDS 2024

作者： Gupta, Sushant Kumar Miller, Marshall David Han, Rachel Guo, Haorui Stanford University Dept. of Computer Science Palo Alto United States

ISBN: (纸本)9798350349658

The InterPlanetary File System (IPFS) is on its way to becoming the backbone of the next generation of the web. However, it suffers from several performance bottlenecks, particularly on the content retrieval path, which are often difficult to debug. This is because content retrieval involves multiple peers on the decentralized network and the issue could lie anywhere in the network. Traditional debugging tools are insufficient to help web developers who face the challenge of slow loading websites and detrimental user experience. This limits the adoption and future scalability of IPFS. In this paper, we aim to gain valuable insights into how content retrieval requests propagate within the IPFS network as well as identify potential performance bottlenecks which could lead to opportunities for improvement. We propose a custom tracing framework that generates and manages traces for crucial events that take place on each peer during content retrieval. The framework leverages event semantics to build a timeline of each protocol involved in the retrieval, helping developers pinpoint problems. Additionally, it is resilient to malicious behaviors of the peers in the decentralized environment. We have implemented this framework on top of an existing IPFS implementation written in Java called Nabu. Our evaluation shows that the framework can identify network delays and issues with each peer involved in content retrieval requests at a very low overhead. © 2024 IEEE.

关键词： Decentralized systems

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 2023 IEEE international parallel and distributed Processing symposium, IPDPS 2023

Proceedings - 2023 IEEE International Parallel and Distribut...

引用

37th IEEE international parallel and distributed Processing symposium, IPDPS 2023

ISBN: (纸本)9798350337662

The proceedings contain 95 papers. The topics discussed include: distributed sparse random projection trees for constructing K-nearest neighbor graphs;fast deterministic gathering with detection on arbitrary graphs: the power of many robots;accurate and efficient distributed covid-19 spread prediction based on a large-scale time-varying people mobility graph;accelerating packet processing in container overlay networks via packet-level parallelism;efficient hardware primitives for immediate memory reclamation in optimistic data structures;efficient hardware primitives for immediate memory reclamation in optimistic data structures;accelerating distributed deep learning training with compression assisted Allgather and reduce-scatter communication;accelerating CNN inference on long vector architectures via co-design;exploiting input tensor dynamics in activation checkpointing for efficient training on GPU;drill: log-based anomaly detection for large-scale storage systems using source code analysis;dynasparse: accelerating GNN inference through dynamic sparsity exploitation;exploiting sparsity in pruned neural networks to optimize large model training;SRC: mitigate I/O throughput degradation in network congestion control of disaggregated storage systems;boosting multi-block repair in cloud storage systems with wide-stripe erasure coding;on doorway egress by autonomous robots;and on the arithmetic intensity of distributed-memory dense matrix multiplication involving a symmetric input matrix (SYMM).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Caching Support for CHFS Node-local Persistent Memory File System 36

Caching Support for CHFS Node-local Persistent Memory File S...

引用

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

作者： Tatebe, Osamu Ohtsuji, Hiroki Univ Tsukuba Tsukuba Ibaraki Japan Fujitsu Ltd Kawasaki Kanagawa Japan

ISBN: (纸本)9781665497473

In this study, we designed a caching parallel file system for node-local persistent memory. The caching parallel file system improves access performance to the backend parallel file system in a way transparent to users. Although existing caching parallel file systems succeed in improving bandwidth, the performance of metadata is limited by that of the backend parallel file system. Based on the CHFS ad hoc parallel and distributed file system, our system maintains the high metadata performance of CHFS by relaxing the consistency with the backend system in easy-to-understand semantics. Upon implementation, our system's performance was evaluated using the 10500 benchmark, and was found to exhibit almost identical performance to that of the original CHFS. This shows that it is possible to realize a caching parallel file system without sacrificing metadata performance.

关键词： caching file system parallel file system persistent memory

来源：评论

学校读者我要写书评

暂无评论

parallel Bayesian Optimization for Optimal Scheduling of Underground Pumped Hydro-Energy Storage systems 36

Parallel Bayesian Optimization for Optimal Scheduling of Und...

引用

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

作者： Gobert, Maxime Gmys, Jan Toubeau, Jean-Francois Melab, Nouredine Tuyttens, Daniel Vallee, Francois Univ Mons Math & Operat Res Mons Belgium Univ Lille CNRS CRIStAL INRIA Lille Nord Europe Lille France Univ Mons Power Syst & Markets Res Mons Belgium

ISBN: (纸本)9781665497473

Underground Pumped Hydro-Energy Storage stations are sustainable options to enhance storage capacity and thus the flexibility of energy systems. Efficient management of such units requires high-performance optimization algorithms able to find solutions in a very restricted timing to comply with the responsive energy markets. In this context, parallel computing offers a valuable solution to ensure appropriate decisions that maximize the profit of the station operator, while guaranteeing the safety of the energy network. This study investigates the use of three existing algorithms in parallel Bayesian Optimization, namely q-EGO, BSP-EGO and TuRBO. The three algorithms have different inherent behaviors in terms of parallel potential and, even though TuRBO scales better, q-EGO remains the best choice regarding the final outcomes for all investigated batch sizes and manages to get up to 5 times more profits than other approaches.

关键词： Bayesian Optimization Gaussian Process Batch-based parallelism Optimization Electrical Engineering

来源：评论

学校读者我要写书评

暂无评论

MDLoader: A Hybrid Model-driven Data Loader for distributed Deep Neural Networks Training

MDLoader: A Hybrid Model-driven Data Loader for Distributed ...

引用

1st international Conference on Smart Energy systems and Artificial Intelligence (SESAI)

作者： Bae, Jonghyun Choi, Jong Youl Pasini, Massimiliano Lupo Mehta, Kshitij Ibrahim, Khaled Z. Lawrence Berkeley Natl Lab Berkeley CA 94720 USA Oak Ridge Natl Lab Oak Ridge TN USA

In this work, we propose MDLoader, a hybrid in-memory data loader for distributed deep neural networks. MDLoader introduces a model-driven performance estimator to automatically switch between one-sided and collective... 详细信息

ISBN: (纸本)9798350364613;9798350364606

关键词： One-sided communication Collective communication Graph Neural Network Performance estimator

来源：评论

学校读者我要写书评

暂无评论

DroMPI: parallel Computation Over Drop Computing 24

DroMPI: Parallel Computation Over Drop Computing

引用

24th IEEE/ACM international symposium on Cluster, Cloud, and Internet Computing (CCGrid)

作者： Grosu, George-Mircea Nistor, Silvia-Elena Ciobanu, Radu-Ioan Dobre, Ciprian Pop, Florin Natl Univ Sci & Technol Politehn Bucharest Bucharest Romania Natl Inst Res & Dev Informat ICI Bucharest Romania Acad Romanian Scientists Bucharest Romania

ISBN: (纸本)9798350377521;9798350377514

With the advancement of technology and the spread of multi-core systems, the need for parallelization arises and the interest in programming models is growing. At the same time, new distributed computing models have been proposed, being in fierce competition to obtain the highest possible performance. The Drop Computing Paradigm proposes the idea of decentralized computing over ad-hoc opportunistic networks of mobile and Edge devices. In this respect, the Drop Computing model does not only aim to achieve a minimum turnaround time but also to optimize other characteristics related to mobile devices, such as limited resources and opportunistic communication. Therefore, it is necessary to define a new programming model called DroMPI that intends to extend the capabilities of current parallel and distributed programming models, based on the Drop Computing paradigm. Therefore, the solution aims to develop a library that takes advantage of hardware capabilities in the interest of the Drop Computing paradigm and also provides programmers with a high-level programming interface. The library's features will be based on the Message Passing Interface (MPI) standard, which will be responsible for inter-node parallelization. The name of the library, DroMPI, is an acronym for Drop Computing and MPI. The implementation of the model will be responsible for the management of communication between nodes and for providing an Application Programming Interface (API) for the development of parallel applications in the Drop Computing paradigm.

关键词： Decentralized Computing parallel Computation Drop Computing Application Programming Interface MPI

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：