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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

9,676 篇 电子文献
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,209 篇 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...
367 篇 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,637 篇 英文
21 篇 中文
18 篇 其他

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

共 9676 条记录，以下是111-120 订阅

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

详细简洁

排序：

Towards A Combined Grouping and Aggregation Algorithm for Fast Query Processing in Columnar databases with GPUs 29

Towards A Combined Grouping and Aggregation Algorithm for Fa...

引用

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

作者： Meraji, Sina Keenleyside, John Kamath, Sunil Blainey, Bob IBM Canada Ltd Hardware Accelerat Lab 8200 Warden Ave Markham ON Canada

ISBN: (纸本)9781467376846

Column-store in-memory databases have received a lot of attention because of their fast query processing response times on modern multi-core machines. Among different database operations, group by/aggregate is an important and potentially costly operation. Moreover, sort-based and hash-based algorithms are the most common ways of processing group by/aggregate queries. While sort-based algorithms are used in traditional DataBase Management systems(DBMS), hash based algorithms can be applied for faster query processing in new columnar databases. Besides, Graphical Processing Units(GPU) can be utilized as fast, high bandwidth co-processors to improve the query processing performance of columnar databases. The focus of this article is on the prototype for group by/aggregate operations that we created to exploit GPUs. We show different hash based algorithms to improve the performance of group by/aggregate operations on GPU. One of the parameters that affect the performance of the group by/aggregate algorithm is the number of groups and hashing algorithm. We show that we can get up to 7.6x improvement in kernel performance compared to a multi-core CPU implementation when we use a partitioned multilevel hash algorithm using GPU shared and global memories.

关键词： Aggregates databases Graphics processing units Instruction sets Kernel Partitioning algorithms Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

The parallel processing of spatial selection for very large geo-spatial databases

The parallel processing of spatial selection for very large ...

引用

8th international Conference on parallel and distributed systems (ICPADS 2001)

作者： Tamura, K Nakano, Y Kaneko, K Makinouchi, A Kyushu Univ Grad Sch Informat Sci & Elect Engn Fukuoka 812 Japan

ISBN: (纸本)0769511538

Earth science (ES) applications handle very large geospatial data sets and interactive response time is required by its query processing. Spatial selection is one of the very important basic operations for gee-spatial databases. It retrieves all the objects that intersect with a given point or rectangle. This paper presents a novel approach for the parallel processing of spatial selection of very large geospatial databases using partitioned parallelism. To evaluate this approach, we use the Extended Sequoia 2000 benchmark, which has real world data and real queries. In addition, we use an actual object database management system, ShusseUo, which we developed previously. The experimental results of parallel processing of spatial selection show good speed-up.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Optimal Batch Plants Design on parallel systems: A Comparative Study 33

Optimal Batch Plants Design on Parallel Systems: A Comparati...

引用

33rd IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Borisenko, Andrey Gorlatch, Sergei Tambov State Tech Univ Tambov Russia Univ Munster Munster Germany

ISBN: (纸本)9781538655559

We report a comparative study on the development of high-performance software for solving the problem of optimal design of multiproduct batch plants on modern parallel systems. We analyze two main algorithmic approaches to optimization - branch-and-bound and metaheuristic-based - and we develop and compare their parallel implementations on a variety of parallel architectures: multi-core CPU, GPU, and clusters. Our experiments on a real-world case study - optimization of chemical-engineering systems - demonstrate the trade-offs between the run time performance and the quality of solutions achieved by different algorithms on various parallel architectures.

关键词： combinatorial optimization multi-product batch plant design branch-and-bound metaheuristics GPU computing

来源：评论

学校读者我要写书评

暂无评论

Adaptive Redundant Data Allocation Using Unused Blocks for Improving Access Efficiency in Dependable Storage systems 33

Adaptive Redundant Data Allocation Using Unused Blocks for I...

引用

IEEE 33rd international symposium on Reliable distributed systems

作者： Ta Hong Viet Tokyo Inst Technol Dept Comp Sci Tokyo Japan

ISBN: (纸本)9781479955848

Error control codes have been widely adopted to design dependable storage systems, thus number of data accesses becomes numerous. Data access efficiency as well as energy saving are important problems. This paper proposes a method which uses variable information word length for improving data access efficiency in dependable storage systems.

关键词： Adaptive systems Arrays distributed databases Encoding Reliability Resource management Sparse matrices MDS code energy saving erasure correction code maximum distance separable codes distributed databases Sparse matrix Adaptive systems Cache Memory System management of resources Access to Information information retrieval energy saving Energy conservation Error correction codes arrays redundant data

来源：评论

学校读者我要写书评

暂无评论

Fast and Efficient Graph Traversal Algorithm for CPUs: Maximizing Single-Node Efficiency

Fast and Efficient Graph Traversal Algorithm for CPUs: Maxim...

引用

26th IEEE international parallel and distributed Processing symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Chhugani, Jatin Satish, Nadathur Kim, Changkyu Sewall, Jason Dubey, Pradeep Intel Corp Parallel Comp Lab Santa Clara CA 95051 USA

ISBN: (纸本)9780769546759

Graph-based structures are being increasingly used to model data and relations among data in a number of fields. Graph-based databases are becoming more popular as a means to better represent such data. Graph traversal is a key component in graph algorithms such as reachability and graph matching. Since the scale of data stored and queried in these databases is increasing, it is important to obtain high performing implementations of graph traversal that can efficiently utilize the processing power of modern processors. In this work, we present a scalable Breadth-First Search Traversal algorithm for modern multi-socket, multi-core CPUs. Our algorithm uses lock- and atomic-free operations on a cache-resident structure for arbitrary sized graphs to filter out expensive main memory accesses, and completely and efficiently utilizes all available bandwidth resources. We propose a work distribution approach for multi-socket platforms that ensures load-balancing while keeping cross-socket communication low. We provide a detailed analytical model that accurately projects the performance of our single- and multi-socket traversal algorithms to within 5-10% of obtained performance. Our analytical model serves as a useful tool to analyze performance bottlenecks on modern CPUs. When measured on various synthetic and real-world graphs with a wide range of graph sizes, vertex degrees and graph diameters, our implementation on a dual-socket Intel (R) Xeon (R) X5570 (Intel microarchitecture code name Nehalem) system achieves 1.5X-13.2X performance speedup over the best reported numbers. We achieve around 1 Billion traversed edges per second on a scale-free R-MAT graph with 64M vertices and 2 Billion edges on a dual-socket Nehalem system. Our optimized algorithm is useful as a building block for efficient multi-node implementations and future exascale systems, thereby allowing them to ride the trend of increasing per-node compute and bandwidth resources.

关键词： bandwidth efficient Graph traversal multi-socket single node

来源：评论

学校读者我要写书评

暂无评论

Semantically Correct and Intent Defined Commutativity in distributed systems 19

Semantically Correct and Intent Defined Commutativity in Dis...

引用

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

作者： Robinson, Courtney Univ Greenwich Dept Comp & Informat Syst London England

ISBN: (纸本)9781728189468

This paper reviews the problem of correctness in the context of scaleable distributed systems. It takes the concept of a strongly eventually consistent (SEC) data structure based on the work done on conflict free replicated data types and examines the theoretical basis of a practical application to generalised database management systems. It reasons that the condition required for a database management system to implement a monotonic semilattice and remain generic is not possible. It further proposes a framework which extends the SEC condition to capture enough information to make such a system practical to implement. Finally, it evaluates such an implementation using a modified storage engine for Apache Ignite demonstrating not just its practicality but its scaleability in Ignite and other database management systems like it. The key contributions of this work are Semantic and intent defined conflict free replicated data types, an enriched CRDT which enables generalised database systems to meet the SEC criteria for a monotonic semilattice object and Semantic Intent Configuration Language, SICL, a language and framework for distributed computing.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

The international symposium on Software Engineering for parallel and distributed systems PDSE'99 99

The International Symposium on Software Engineering for Para...

引用

1999 international Conference on Softeare Engineering

作者： Peter R Croll Hesham El-Rewini Universtiy of Sheffield UK University of Nebraska Omaha

ISBN: (纸本)9781581130744

The PDSE'99 symposium, now in its fourth successive year, is a continuation of the inaugural PDSE'96 workshop held in conjunction with ICSE-18 in Berlin. This was followed by ICSE events in Boston, 1997 and in Kyoto, 1998. The PDSE symposiums attract up to 50 delegates from a wide range of backgrounds from both industry and academia from around the world. The papers are always published internationally, more recently as IEEE proceedings, and are refereed by a minimum of three independent experts in the field. The talks include keynote speakers with an emphasis on first hand experience of industrial applications and large-scale projects.

关键词： Software engineering parallel Lines distributed systems Berlin Germany Industrial applications independent experts CONJUNCTION

来源：评论

学校读者我要写书评

暂无评论

Towards Efficient Closed Pattern Mining from distributed Multi-Relational Data 7

Towards Efficient Closed Pattern Mining from Distributed Mul...

引用

Joint 7th international Conference on Soft Computing and Intelligent systems (SCIS) and 15th international symposium on Advanced Intelligent systems (ISIS)

作者： Kamiya, Yohei Seki, Hirohisa Nagoya Inst Technol Dept Comp Sci Nagoya Aichi 4668555 Japan

ISBN: (纸本)9781479959556

We consider closed pattern mining from distributed multi-relational databases, especially focusing on its efficient implementation. Given a set of local databases (horizontal partitions), we first compute their sets of closed patterns (concepts) using a closed pattern mining algorithm tailored to multi-relational data mining (MRDM). We then generate the set of closed patterns in the global database by utilizing the merge (or subposition) operator, studied in the field of Formal Concept Analysis. Since the computational complexity of MRDM increases compared with the conventional itemset mining, we propose some methods for improving the overall computations. We also present some experimental results using a distributed computation environment based on the MapReduce framework, which shows the effectiveness of the proposed methods.

关键词： multi-relational data mining closed patterns merge (subposition) operator FCA distributed databases

来源：评论

学校读者我要写书评

暂无评论

A distributed approach to content based image retrieval

A distributed approach to content based image retrieval

引用

international Conference on parallel and distributed Processing Techniques and Applications

作者： Krovi, A Rahimi, S So Illinois Univ Dept Comp Sci Carbondale IL 62901 USA

ISBN: (纸本)1892512459

Digital images are being generated at a phenomenal rate. Currently, the most common method by far for searching digital image databases is based on employing index terms which are entered manually. Content based image retrieval (CM) systems are required to effectively and efficiently use the information that is intrinsically stored in these image databases. However, CBIR on multiple image databases is a slow process that needs performance improvement. In this paper, we present a distributed approach to CBIR, an image retrieval scheme that retrieves images based on segmentation and signature in a distributed environment.

关键词： CBIR distributed systems distributed database

来源：评论

学校读者我要写书评

暂无评论

parallel Simulation of Power systems with High Penetration of distributed Generation Using GPUs and OpenCL 13

Parallel Simulation of Power Systems with High Penetration o...

引用

13th international symposium on Power Electronics for distributed Generation systems (PEDG)

作者： Zhang, Junjie Mittenbuehler, Marcel Razik, Lukas Benigni, Andrea Forschungszentrum Julich IEK 10 Energy Syst Engn D-52428 Julich Germany Rhein Westfal TH Aachen D-52056 Aachen Germany Raz InformING D-52070 Aachen Germany JARA Energy D-52425 Julich Germany

ISBN: (数字)9781665466189

ISBN: (纸本)9781665466189

In this paper, we present the use of parallel-in-space simulation approach to accelerate the dynamic simulation of power systems with high penetration of distributed generation, i. e. high number of power electronic devices. The approach is implemented using the OpenCL framework and executed on a graphic processing unit (GPU). We benchmark our prototype implementation using a distribution network with increasing number of distributed generator which is modeled by voltage source inverter. Results show that the computation time for the distributed generators solution stays nearly constant with the increasing number of the distributed generators in the network.

关键词： parallel programming power system simulation power electronics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：