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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

497 篇 会议
10 篇 期刊文献
6 册 图书

馆藏范围

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

日期分布

学科分类号

197 篇 工学
- 185 篇 计算机科学与技术...
- 96 篇 软件工程
- 37 篇 信息与通信工程
- 26 篇 电气工程
- 13 篇 控制科学与工程
- 10 篇 材料科学与工程（可...
- 9 篇 电子科学与技术（可...
- 4 篇 网络空间安全
- 3 篇 安全科学与工程
- 2 篇 光学工程
- 2 篇 动力工程及工程热...
- 2 篇 土木工程
- 2 篇 化学工程与技术
- 2 篇 石油与天然气工程
- 2 篇 交通运输工程
- 1 篇 力学（可授工学、理...
- 1 篇 冶金工程
54 篇 理学
- 48 篇 数学
- 6 篇 统计学（可授理学、...
- 5 篇 系统科学
- 4 篇 物理学
- 2 篇 化学
- 2 篇 生物学
- 1 篇 地质学
34 篇 管理学
- 28 篇 管理科学与工程(可...
- 14 篇 工商管理
- 8 篇 图书情报与档案管...
4 篇 经济学
- 4 篇 应用经济学
2 篇 法学
- 2 篇 社会学
1 篇 文学
- 1 篇 新闻传播学
1 篇 医学
1 篇 军事学

主题

93 篇 computer science
79 篇 concurrent compu...
71 篇 distributed comp...
67 篇 application soft...
65 篇 database systems
62 篇 parallel process...
59 篇 databases
57 篇 distributed data...
43 篇 transaction data...
42 篇 delay
39 篇 computer archite...
37 篇 algorithm design...
36 篇 costs
36 篇 relational datab...
35 篇 hardware
30 篇 processor schedu...
30 篇 large-scale syst...
27 篇 computational mo...
27 篇 performance anal...
27 篇 computer network...

机构

7 篇 ibm thomas j. wa...
4 篇 department of co...
3 篇 ieee
3 篇 king saud univer...
3 篇 school of comput...
3 篇 department of co...
2 篇 department of co...
2 篇 toyohashi univer...
2 篇 center for paral...
2 篇 department of co...
2 篇 school of comput...
2 篇 computer science...
2 篇 department of el...
2 篇 university of el...
2 篇 school of comput...
2 篇 department of bi...
2 篇 school of comput...
2 篇 eth zurich
2 篇 computer science...
2 篇 computer science...

作者

6 篇 a. choudhary
5 篇 j. saltz
4 篇 t. kurc
4 篇 a. boukerche
4 篇 a. el abbadi
3 篇 f. dehne
3 篇 p.s. yu
3 篇 wan maseri wan m...
3 篇 a. bar-noy
3 篇 s. kipnis
3 篇 g. gupta
3 篇 jasni mohamad za...
3 篇 eyas el-qawasmeh
3 篇 d. agrawal
2 篇 a. burger
2 篇 a. rau-chaplin
2 篇 a. ghafoor
2 篇 s. bandyopadhyay
2 篇 hoefler torsten
2 篇 o. wolfson

语言

509 篇 英文
4 篇 其他

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

共 513 条记录，以下是41-50 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

distributed Ranking in Networks with Limited Memory and Communication

Distributed Ranking in Networks with Limited Memory and Comm...

引用

IEEE international symposium on Information Theory

作者： Jung, Kyomin Kim, Bo Young Vojnovic, Milan Korea Adv Inst Sci & Technol Taejon 305701 South Korea Microsoft Res Cambridge England

ISBN: (纸本)9781467325790

We study a basic information ranking problem in networks where each node holds an individual preference over a set of items and the goal for each node is to identify a sorted list of items with the largest aggregate preference. We would like to achieve this with a fully decentralized algorithm that uses a limited per-node memory and limited pair-wise communications. We show how this problem can be reduced to a plurality selection problem where the goal for each node is to identify an item with the largest aggregate ranking score, and show that solving the reduced problem solves the original ranking problem with high probability. Then we introduce a simple and natural plurality selection algorithm for the selection over m > 1 items that uses only log(2) (m) + 1 bits of per-node memory and per pair-wise communication. We prove correctness of the algorithm with high probability as the number of nodes grows large for the case when each node communicates with any other node, and establish tight convergence time bounds. The information ranking problem studied in this paper is a basic ranking problem that arises in various applications such as sorting elements in distributed computing systems, parallel databases, and may as well serve as a model of decentralized inference and opinion formation in distributed environments.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

ARCSM: A distributed feedback control mechanism for security-critical real-time system

ARCSM: A distributed feedback control mechanism for security...

引用

2012 10th IEEE international symposium on parallel and distributed Processing with Applications, ISPA 2012

作者： Ma, Yue Jiang, Wei Sang, Nan Zhang, Xia School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731 China Informatics and Mathematical Modeling Department Technical University of Denmark DK-2800 Kongens Lyngby Denmark

ISBN: (纸本)9780769547015

Since the real-time systems are becoming increasingly networked, there are some growing critical challenges of security management and risk control. For the unpredicted and especially unsecured environments, such security-critical distributed real-time embedded systems need to enforce security on multiple nodes in order to against the potential threats as well as satisfying the real-time requirements. Unlike the traditional ad hoc static designing approaches, based on feedback theory, this paper proposes an Adaptive Risk Control and Security Management (ARCSM) mechanism for centralized distributed systems. ARCSM has the ability to guarantee the soft real-time and provide as strong security protection as possible. To meet this requirement, the host server is able to refuse to serve for the deadline missed tasks. In each node, a two-level scheduling framework is designed to implement the feedback control twice. In the first feedback, an appropriate initial security level is assigned for new task. At the runtime, the second feedback can dynamically adjust the ready tasks' security level based on runtime status. Considering features of embedded systems, we measured the energy and time costs of cryptographic algorithms and established a method to quantify the security risk. Moreover, the relationship between time and energy costs analyzed in this paper leaves its significance for the future researches. Experimental results demonstrate that our mechanism can be adaptive to the fluctuation of input workloads and has better performance than open-loop schemes. © 2012 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

distributed ranking in networks with limited memory and communication

Distributed ranking in networks with limited memory and comm...

引用

IEEE international symposium on Information Theory

作者： Kyomin Jung Bo Young Kim Milan Vojnovic KAIST Daejeon South Korea Microsoft Research Cambridge UK

ISBN: (纸本)9781467325790

We study a basic information ranking problem in networks where each node holds an individual preference over a set of items and the goal for each node is to identify a sorted list of items with the largest aggregate preference. We would like to achieve this with a fully decentralized algorithm that uses a limited per-node memory and limited pair-wise communications. We show how this problem can be reduced to a plurality selection problem where the goal for each node is to identify an item with the largest aggregate ranking score, and show that solving the reduced problem solves the original ranking problem with high probability. Then we introduce a simple and natural plurality selection algorithm for the selection over m >; 1 items that uses only log 2 (m) + 1 bits of per-node memory and per pair-wise communication. We prove correctness of the algorithm with high probability as the number of nodes grows large for the case when each node communicates with any other node, and establish tight convergence time bounds. The information ranking problem studied in this paper is a basic ranking problem that arises in various applications such as sorting elements in distributed computing systems, parallel databases, and may as well serve as a model of decentralized inference and opinion formation in distributed environments.

关键词： Convergence Aggregates Peer to peer computing Stochastic systems Heuristic algorithms Markov processes Information theory

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Jatin Chhugani Nadathur Satish Changkyu Kim Jason Sewall Pradeep Dubey Parallel Computing Laboratory Intel Corporation USA

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 ® Xeon ® 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.

关键词： Sockets Arrays Bandwidth Instruction sets Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

parallelGDB: A parallel Graph Database based on Cache Specialization 11

<i>ParallelGDB</i>: A Parallel Graph Database based on Cache...

引用

15th international Database Engineering and Applications symposium (IDEAS)

作者： Barguno, Luis Muntes-Mulero, Victor Dominguez-Sal, David Valduriez, Patrick UPC DAMA Barcelona Spain INRIA LIRMM Rocquencourt France

ISBN: (纸本)9781450306270

The need for managing massive attributed graphs is becoming common in many areas such as recommendation systems, proteomics analysis, social network analysis or bibliographic analysis. This is making it necessary to move towards parallel systems that allow managing graph databases containing millions of vertices and edges. Previous work on distributed graph databases has focused on finding ways to partition the graph to reduce network traffic and improve execution time. However, partitioning a graph and keeping the information regarding the location of vertices might be unrealistic for massive graphs. In this paper, we propose parallel-GDB, a new system based on specializing the local caches of any node in this system, providing a better cache hit ratio. parallelGDB uses a random graph partitioning, avoiding complex partition methods based on the graph topology, that usually require managing extra data structures. This proposed system provides an efficient environment for distributed graph databases.

关键词： Graph database Cache specialization Graph algorithms distributed and parallel computing distributed graphs

来源：评论

学校读者我要写书评

暂无评论

Software Engineering and Computer systems, Part III 2011

引用

丛书名： Communications in Computer and Information Science

2011年

作者： Jasni Mohamad Zain Wan Maseri Wan Mohd Eyas El-Qawasmeh

ISBN: (数字)9783642222030

ISBN: (纸本)9783642222023

This Three-Volume-Set constitutes the refereed proceedings of the second international Conference on Software Engineering and Computer systems, ICSECS 2011, held in Kuantan, Malaysia, in June 2011. The 190 revised full papers presented together with invited papers in the three volumes were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on software engineering; network; bioinformatics and e-health; biometrics technologies; Web engineering; neural network; parallel and distributed; e-learning; ontology; image processing; information and data management; engineering; software security; graphics and multimedia; databases; algorithms; signal processing; software design/testing; e- technology; ad hoc networks; social networks; software process modeling; miscellaneous topics in software engineering and computer systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Software Engineering and Computer systems, Part II 2011

引用

丛书名： Communications in Computer and Information Science

2011年

作者： Jasni Mohamad Zain Wan Maseri Wan Mohd Eyas El-Qawasmeh

ISBN: (数字)9783642221910

ISBN: (纸本)9783642221903

This Three-Volume-Set constitutes the refereed proceedings of the second international Conference on Software Engineering and Computer systems, ICSECS 2011, held in Kuantan, Malaysia, in June 2011. The 190 revised full papers presented together with invited papers in the three volumes were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on software engineering; network; bioinformatics and e-health; biometrics technologies; Web engineering; neural network; parallel and distributed e-learning; ontology; image processing; information and data management; engineering; software security; graphics and multimedia; databases; algorithms; signal processing; software design/testing; e- technology; ad hoc networks; social networks; software process modeling; miscellaneous topics in software engineering and computer systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Software Engineering and Computer systems, Part I 2011

引用

丛书名： Communications in Computer and Information Science

2011年

作者： Jasni Mohamad Zain Wan Maseri Wan Mohd Eyas El-Qawasmeh

ISBN: (数字)9783642221705

ISBN: (纸本)9783642221699

关键词：

来源：评论

学校读者我要写书评

暂无评论

Advances in Spatial and Temporal databases - 12th international symposium, SSTD 2011, proceedings

Advances in Spatial and Temporal Databases - 12th Internatio...

引用

12th international symposium on Advances in Spatial and Temporal databases, SSTD 2011

ISBN: (纸本)9783642229213

The proceedings contain 40 papers. The topics discussed include: FAST: a generic framework for flash-aware spatial trees;MIDAS: multi-attribute indexing for distributed architecture systems;thread-level parallel indexing of update intensive moving-object workloads;efficient processing of Top-k spatial keyword queries;retrieving k-nearest neighboring trajectories by a set of point locations;towards reducing taxicab cruising time using spatio-temporal profitability maps;computing the cardinal direction development between moving points in spatio-temporal databases;continuous probabilistic count queries in wireless sensor networks;geodetic point-in-polygon query processing in oracle spatial;MSSQ: manhattan spatial skyline queries;inverse queries for multidimensional spaces;efficient evaluation of k-NN queries using spatial mashups;and SeTraStream: semantic-aware trajectory construction over streaming movement data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：