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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

1,198 篇 distributed data...
995 篇 distributed comp...
954 篇 parallel process...
780 篇 concurrent compu...
778 篇 computer science
693 篇 databases
616 篇 computer archite...
586 篇 application soft...
559 篇 computational mo...
467 篇 parallel process...
369 篇 scalability
351 篇 distributed comp...
345 篇 distributed proc...
333 篇 hardware
325 篇 database systems
293 篇 parallel program...
293 篇 processor schedu...
290 篇 resource managem...
287 篇 costs
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
12 篇 sun xian-he
11 篇 hoefler torsten
11 篇 s.k. das
11 篇 jack dongarra
11 篇 kurt rothermel
10 篇 choudhary a
10 篇 j. saltz
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,597 篇 英文
63 篇 其他
21 篇 中文

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

共 9681 条记录，以下是861-870 订阅

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

详细简洁

排序：

A New Julia-Based parallel Time-Domain Simulation Algorithm for Analysis of Power System Dynamics 24

A New Julia-Based Parallel Time-Domain Simulation Algorithm ...

引用

IEEE/ACM 24th international symposium on distributed Simulation and Real Time Applications (DS-RT)

作者： Kyesswa, Michael Schmurr, Philipp Cakmak, Hueseyin K. Kuehnapfel, Uwe Hagenmeyer, Veit Karlsruhe Inst Technol Inst Automat & Appl Informat Karlsruhe Germany

ISBN: (纸本)9781728173436

The present paper describes a new parallel time-domain simulation algorithm using a high performance computing environment - Julia - for the analysis of power system dynamics in large networks. The parallel algorithm adapts a parallel-in-space decomposition scheme to a previously sequential algorithm in order to develop a new parallelizable numerical solution of the power system equations. The parallel-in-space decomposition is based on the block bordered diagonal form, which reformulates the network admittance matrix into sub-blocks that can be solved in parallel. For the optimal spatial decomposition of the network, a new extended graph partitioning strategy is developed for load balancing and minimizing the communication between subnetworks. The new parallel simulation algorithm is tested using standard test networks of varying complexity. The simulation results are compared to those obtained from a sequential implementation in order to validate the solution accuracy and to determine the performance improvement in terms of computational speedup. Test simulations are conducted using the ForHLR II supercomputing cluster and show a huge potential in computational speedup with increasing network complexity.

关键词： Graph partitioning parallel computing power systems time-domain simulation transient stability analysis

来源：评论

学校读者我要写书评

暂无评论

Massively parallel In-Situ Sensing using Femto-Spacecraft Clouds 28

Massively Parallel In-Situ Sensing using Femto-Spacecraft Cl...

引用

28th IAA symposium on Small Satellite Missions 2021 at the 72nd international Astronautical Congress, IAC 2021

作者： Timmons, Thomas Beeley, James Bailet, Gilles McInnes, Colin R. Space and Exploration Technology Group James Watt School of Engineering University of Glasgow G12 8QQ United Kingdom

Many physical phenomena in the near-Earth space environment are characterised by significant spatial and/or temporal dynamics and ambiguities. While satellite clusters can be utilised to sense such phenomena in a distributed manner, in this paper we propose a new strategy using clouds of centimetre-scale femto-spacecraft equipped with micro-electro-mechanical systems (MEMS) sensors. This architecture would deliver massively parallel simultaneous multi-point sensing, facilitate sampling at a range of spatial length scales and help deconvolve spatial and temporal effects. We investigate the qualitative and quantitative trade-offs in utilising thousands of femto-spacecraft dispersed from a carrier platform to improve the measurement of phenomena across the volume of space that the cloud forms. This contrasts with traditional distributed cluster architectures which would use fewer, larger, more expensive and more accurate sensing platforms, but would offer far fewer simultaneous measurements. We examine how these tradeoffs scale as the number of sensor nodes increases versus lower quality measurements in several use cases. © 2021 international Astronautical Federation, IAF. All rights reserved.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Pierre Civit Seth Gilbert Vincent Gramoli Rachid Guerraoui Jovan Komatovic CNRS Sorbonne University NUS Singapore EPFL University of Sydney &#x00C9 cole Polytechnique Federale de Lausanne (EPFL)

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_distributed$ = ┌ $n$ /3┐ − 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_distributed$ ) and allowing correct processes to obtain proof of culpability of (at least) $t_distributed+ 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-to-all communication rounds and $O(n^distributed)$ additional bits in executions with up to $t_distributed$ faults (i.e., in the common case). 2) We define the accountability complexity, a complex-ity metric representing the number of accountability-specific messages that correct processes must send. Fur-thermore, 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 Byzan-tine 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) op-timal with respect to the accountability complexity in obtaining accountability whenever disagreement occurs. 4) We generalize ABC to other distributed computing prob-lems besides the classic consensus problem. We charac-terize 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

来源：评论

学校读者我要写书评

暂无评论

Development and benchmarking a parallel Data AcQuisition framework using MPI with hash and hash plus tree structures in a cluster environment 19

Development and benchmarking a parallel Data AcQuisition fra...

引用

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

作者： Czarnul, Pawel Golaszewski, Grzegorz Jereczek, Grzegorz Maciejewski, Maciej Gdansk Univ Technol Fac Elect Telecommun & Informat Narutowicza 11-12 PL-80233 Gdansk Poland Intel Technol Poland Slowackiego 173 PL-80298 Gdansk Poland

ISBN: (纸本)9781728189468

In the paper we propose a solution that uses either a 3-layered index structure based on hash tables or a hash+tree structure for efficient parallel processing of data in a Data AcQuisition (DAQ) system. The proposed framework allows for parallel data writes from multiple multithreaded client processes to multiple multithreaded server processes that use a thread-safe hash-table-based library. Communication is conducted using an MPI_THREAD_MULTIPLE enabled MPI implementation. We demonstrate that the solution scales well in two cluster configurations using InfiniBand, specifically for increasing numbers of client as well as server threads. We present how performance depends on various configuration parameters of a DAQ systems like data distribution across the readout system, its size, and percentage of data to be fetched. Furthermore, we show how it depends on the size of value associated with a given write/read. We compare the performance of both proposed data structures for different configurations. The results allow the reader to learn real performance numbers and characteristics of such a solution, applicable to large scale parallel data processing in a DAQ system and choose the optimal solution.

关键词： Data AcQuisition (DAQ) system parallel processing scalability Message Passing Interface

来源：评论

学校读者我要写书评

暂无评论

Simulating Heterogeneous Models on Multi-Core Platforms using Julia's Computing Language parallel Potential 24

Simulating Heterogeneous Models on Multi-Core Platforms usin...

引用

IEEE/ACM 24th international symposium on distributed Simulation and Real Time Applications (DS-RT)

作者： Suslov, Sergey Schiek, Michael Robens, Markus Grewing, Christian van Waasen, Stefan Res Ctr Julich ZEA Elect Syst 2 Julich Germany

ISBN: (纸本)9781728173436

This paper addresses the questions of high-level system modelling using heterogeneous multi-tool modelling environment on parallel multi-core processing systems for simulation acceleration. The modelling technique has been applied for high-level validation of a high-precision Indoor Positioning System for Motion Analysis (IPS-MA) developed in the Central Institute Electronic systems (ZEA-2) of the Research Center Juelich GmbH. The heterogeneous modelling environment has been built using an implementation-level model designed in Matlab Simulink, a verification model for describing the system environment using Modelica language, and Julia language for automatic generation of binding modelling environment and parallelizing the simulation of the overall model. The approach showed a good flexibility in system description and verification in the multi-instrument modelling environment and a good performance gain due to simulation parallelism.

关键词： distributed simulation high level system modelling functional verification Julia computing language Modelica parallelized simulation

来源：评论

学校读者我要写书评

暂无评论

The AMPERE Project: A Model-driven development framework for highly parallel and EneRgy-Efficient computation supporting multi-criteria optimization 23

The AMPERE Project: A Model-driven development framework for...

引用

IEEE 23rd international symposium on Real-Time distributed Computing (ISORC)

作者： Quinones, Eduardo Royuela, Sara Scordino, Claudio Gai, Paolo Pinho, Luis Miguel Nogueira, Luis Rollo, Jan Cucinotta, Tommaso Biondi, Alessandro Hamann, Arne Ziegenbein, Dirk Saoud, Hadi Soulat, Romain Forsberg, Bjoern Benini, Luca Mando, Gianluca Rucher, Luigi Barcelona Supercomp Ctr Barcelona Spain Evidence Srl Pisa Italy Inst Super Engn Porto Porto Portugal Sysgo Prague Czech Republic Scuola Super Sant Anna Pisa Italy Bosch Stuttgart Germany Thales Res & Technol Palaiseau France Swiss Fed Inst Technol Zurich Switzerland Thales Italy Florence Italy

ISBN: (纸本)9781728169583

The high-performance requirements needed to implement the most advanced functionalities of current and future Cyber-Physical systems (CPSs) are challenging the development processes of CPSs. On one side, CPSs rely on model-driven engineering (MDE) to satisfy the non-functional constraints and to ensure a smooth and safe integration of new features. On the other side, the use of complex parallel and heterogeneous embedded processor architectures becomes mandatory to cope with the performance requirements. In this regard, parallel programming models, such as OpenMP or CUDA, are a fundamental brick to fully exploit the performance capabilities of these architectures. However, parallel programming models are not compatible with current MDE approaches, creating a gap between the MDE used to develop CPSs and the parallel programming models supported by novel and future embedded platforms. The AMPERE project will bridge this gap by implementing a novel software architecture for the development of advanced CPSs. To do so, the proposed software architecture will be capable of capturing the definition of the components and communications described in the MDE framework, together with the non-functional properties, and transform it into key parallel constructs present in current parallel models, which may require extensions. These features will allow for making an efficient use of underlying parallel and heterogeneous architectures, while ensuring compliance with non-functional requirements, including those on real-time performance of the system.

关键词： parallel programming models parallel and heterogeneous embedded processor architectures model-driven approaches safety-critical embedded systems

来源：评论

学校读者我要写书评

暂无评论

Memory Access Granularity Aware Lossless Compression for GPUs

Memory Access Granularity Aware Lossless Compression for GPU...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Sohan Lal Manuel Renz Julian Hartmer Ben Juurlink Technische Universit&#x00E4 t Hamburg Germany t Berlin Germany

High-bandwidth off-chip memory has played a key role in the success of Graphics Processing Units (GPUs) as an accelerator. However, as memory bandwidth scaling continues to lag behind the computational power, it remains a key bottleneck in computing systems. While memory compression has shown immense potential to increase the effective memory bandwidth by compressed data transfers between on-chip and off-chip memory, the large memory access granularity (MAG) of off-chip memory limits compression techniques from achieving a high effective compression ratio. Unfortunately, state-of-the-art lossless memory compression techniques do not take the large MAG of off-chip memory into account. A recent study has used MAG-aware approximation to increase the effective compression ratio, however, not all applications can tolerate errors, which limits its applicability. We propose extensions and GPU-specific optimizations to adapt a lossless memory compression technique to a MAG size to increase the effective compression ratio and performance gain. Our technique is based on the well-known Base-Delta-Immediate (BDI) compression technique that compresses a memory block to a common base and multiple deltas. We leverage the key observation that deltas often contain enough leading zeros to compress a block to a multiple of MAG without any loss of information. We show that MAG-aware BDI provides, on average, 48 % higher effective compression ratio, 10% (up to 27%) higher speedup, and 16% bandwidth reduction compared to normal BDI. While BDI, FPC, and CPACK have a similar compression ratio, MAG-aware BDI outperforms FPC, CPACK, and SLC by 56%, 47%, and 33%, respectively.

关键词： distributed processing Graphics processing units Bandwidth Performance gain Data transfer Encoding System-on-chip

来源：评论

学校读者我要写书评

暂无评论

Blockchain-based Disaster Recovery Data Storage and Security Auditing Solution in Multi-cloud Environment

Blockchain-based Disaster Recovery Data Storage and Security...

引用

international Applied Computational Electromagnetics Society symposium (ACES)

作者： Bin Liu Yang Xin Suhuan Dai College of Information and Network Engineering Anhui Science and Technology University Bengbu China National Engineering Research Center for Disaster Backup and Recovery Beijing University of Posts and Telecommunications Beijing China School of Foreign Languages Anhui Science and Technology University Bengbu China

The utilization of cloud disaster recovery services has emerged as the current trend in data disaster recovery research and application due to the quick growth of virtualization technology and cloud applications. Single-cloud disaster recovery services fall short of users’ demands for data security backup due to technical flaws, managerial weaknesses, network attacks, natural calamities, etc. To implement cross-cloud disaster recovery and multi-cloud data storage, disaster recovery systems must be deployed in multi-cloud and heterogeneous cloud settings. To do this, problems with distributed cross-cloud storage’s data batch audit and problem resolution must also be resolved. In this paper, we propose a blockchain-based distributed storage and security audit solution for disaster recovery data in a multi-cloud environment, which addresses the issues of multi-copy storage management and security audit of multi-cloud data.

关键词： Cloud computing Data security Storage management distributed databases Memory Market research Computational electromagnetics

来源：评论

学校读者我要写书评

暂无评论

3rd BenchCouncil international symposium on Benchmarking, Measuring, and Optimizing, Bench 2020

3rd BenchCouncil International Symposium on Benchmarking, Me...

引用

3rd BenchCouncil international symposium on Benchmarking, Measuring, and Optimizing, Bench 2020

ISBN: (纸本)9783030710576

The proceedings contain 13 papers. The special focus in this conference is on Benchmarking, Measuring, and Optimizing. The topics include: Artemis: An Automatic Test Suite Generator for Large Scale OLAP Database;OStoreBench: Benchmarking distributed Object Storage systems Using Real-World Application Scenarios;ConfAdvisor: An Automatic Configuration Tuning Framework for NoSQL Database Benchmarking with a Black-box Approach;Optimization of the Himeno Benchmark for SX-Aurora TSUBASA;parallel Sorted Sparse Approximate Inverse Preconditioning Algorithm on GPU;preface;characterizing the Sharing Behavior of Applications Using Software Transactional Memory;ComScribe: Identifying Intra-node GPU Communication;a Benchmark of Ocular Disease Intelligent Recognition: One Shot for Multi-disease Detection;MAS3K: An Open Dataset for Marine Animal Segmentation;benchmarking Blockchain Interactions in Mobile Edge Cloud Software systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

IGOR: Accelerating Byzantine Fault Tolerance for Real-Time systems with Eager Execution 27

IGOR: Accelerating Byzantine Fault Tolerance for Real-Time S...

引用

30th IEEE international symposium on Software Reliability Engineering (ISSRE)

作者： Loveless, Andrew Dreslinski, Ronald Kasikci, Baris Linh Thi Xuan Phan Univ Michigan Ann Arbor MI 48109 USA Univ Penn Philadelphia PA 19104 USA NASA Johnson Space Ctr Houston TX 77058 USA

ISBN: (纸本)9781665403863

Critical real-time systems like spacecraft and aircraft commonly use Byzantine fault-tolerant (BFT) state machine replication (SMR) to mask faulty processors and sensors. Unfortunately, existing BFT SMR techniques require replicas to reach agreement on redundant sensor data and perform source selection before executing, which adds unavoidable latency to every execution and inevitably decreases control performance. The standard way to reduce the latency of BFT SMR in non-real-time systems is to use speculation, forgoing agreement on inputs altogether, and repeating executions when faults occur. However, this approach is not suitable for real-time systems, since its worst-case latency when faults occur can be even higher than that of non-speculative systems. This paper presents IGOR, a new speculative BFT SMR approach that leverages multi-core processors to avoid the added latency inherent to traditional BFT SMR techniques in both the absence and presence of faults. The key idea of IGOR is to eagerly execute on data from redundant sensors in parallel. While these executions are underway, the replicas reach agreement on which execution will determine the system's final state. As a result, IGOR's latency is reduced to the time taken by the executions or by the agreement process, whichever is longer. Our evaluation shows that IGOR reduces latency by up to 1.75x and improves schedulability by 1.88-3.22x compared to the state of the art. We also show that when used to execute spacecraft guidance, navigation, and control software during a dynamic mission phase, IGOR noticeably increases vehicle stability.

关键词： Byzantine fault tolerance state machine replication speculative execution multi-core real-time systems distributed systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 83 84 85 86 87 88 89 90 91 92 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：