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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是191-200 订阅

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

详细简洁

排序：

Graphulo: Linear Algebra Graph Kernels for NoSQL databases 29

Graphulo: Linear Algebra Graph Kernels for NoSQL Databases

引用

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

作者： Gadepally, Vijay Bolewski, Jake Hook, Dan Hutchison, Dylan Miller, Ben Kepner, Jeremy MIT Lincoln Lab Cambridge MA 02139 USA MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA Stevens Inst Technol Hoboken NJ 07030 USA

ISBN: (纸本)9781467376846

Big data and the Internet of Things era continue to challenge computational systems. Several technology solutions such as NoSQL databases have been developed to deal with this challenge. In order to generate meaningful results from large datasets, analysts often use a graph representation which provides an intuitive way to work with the data. Graph vertices can represent users and events, and edges can represent the relationship between vertices. Graph algorithms are used to extract meaningful information from these very large graphs. At MIT, the Graphulo initiative is an effort to perform graph algorithms directly in NoSQL databases such as Apache Accumulo or SciDB, which have an inherently sparse data storage scheme. Sparse matrix operations have a history of efficient implementations and the Graph Basic Linear Algebra Subprogram (GraphBLAS) community has developed a set of key kernels that can be used to develop efficient linear algebra operations. However, in order to use the GraphBLAS kernels, it is important that common graph algorithms be recast using the linear algebra building blocks. In this article, we look at common classes of graph algorithms and recast them into linear algebra operations using the GraphBLAS building blocks.

关键词： Algorithm design and analysis Arrays databases Kernel Linear algebra Matrix converters Sparse matrices

来源：评论

学校读者我要写书评

暂无评论

parallel Implementation Strategies for Hierarchical Non-Uniform Memory Access systems by Example of the Scale-Invariant Feature Transform Algorithm 30

Parallel Implementation Strategies for Hierarchical Non-Unif...

引用

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

作者： Plauth, Max Hagen, Wieland Feinbube, Frank Eberhardt, Felix Feinbube, Lena Polze, Andreas Univ Potsdam Hasso Plattner Inst Software Syst Engn Operating Syst & Middleware Grp Potsdam Germany

ISBN: (纸本)9781509036820

The domains of parallel and distributed computing have been converging continuously up to the degree that state-of-the-art server computer systems incorporate characteristics from both domains: They comprise a hierarchy of enclosures, where each enclosure houses multiple processor sockets and each socket again contains multiple memory controllers. A global address space and cache coherency are facilitated using multiple layers of fast interconnection technologies even across enclosures. The growing popularity of such systems creates an urge for efficient mappings of cardinal algorithms onto such hierarchical architectures. However, the growing complexity of such systems and the inconsistencies between implementation strategies of different hardware vendors make it increasingly harder to do find efficient mapping strategies that are universally valid. In this paper, we present scalable optimization and mapping strategies in a case study of the popular Scale-Invariant Feature Transform (SIFT) computer vision algorithm. Our approaches are evaluated using a state-of-the-art hierarchical Non-Uniform Memory Access (NUMA) system with 240 physical cores and 12 terabytes of memory, apportioned across 16 NUMA nodes (sockets). SIFT is particularly interesting since the algorithm utilizes a variety of common data access patterns, thus allowing us to discuss the scaling properties of optimization strategies from the distributed and parallel computing domains and their applicability on emerging server systems.

关键词： parallel programming Memory management Multiprocessor interconnection networks Network topology

来源：评论

学校读者我要写书评

暂无评论

The Importance and Characteristics of Communication in High Performance Data Analytics

The Importance and Characteristics of Communication in High ...

引用

IEEE international symposium on Workload Characterization (IISWC)

作者： Anghel, Andreea Rodriguez, German Prisacari, Bogdan IBM Res Zurich Zurich Switzerland

ISBN: (纸本)9781479964536

Social networks and business analytics typically need to process vast amounts of data that are often modeled as graphs. The scale of the data that such applications have to handle requires large-scale distributed computing systems, together with scalable parallel algorithms, to efficiently process the graphs. Representative of the graph-based analytics class of applications is the Graph 500 benchmark (Murphy, ***., 2010), which is designed to assess the performance of supercomputing systems by solving the Breadth-First Search (BFS) graph traversal problem. In this work, we analyze the network data motion of a Graph 500 MPI version of the graph traversal problem, using a large-scale high-performance computing system, i.e., the MareNostrum III supercomputer (http://***/marenostrum-support-services/mn3). We focus our analysis on the node-to-node communication and show that the application runtime is communication-bound, the communication making up as much as 80 % of the execution time of each BFS iteration. We also show that the dominating communication pattern is an overall all-to-all exchange (every process communicates to every other process and roughly the same amount of data is exchanged between any two processes), thus providing preliminary guidance for future application or network design optimization efforts.

关键词： Benchmark testing Computational modeling Data analysis distributed databases Electric breakdown Instruments Runtime Benchmark testing distributed databases Runtime Electric breakdown Computational modeling Communication Research Data analysis execution time Line graph

来源：评论

学校读者我要写书评

暂无评论

Effect of skew on join performance in parallel architectures

引用

Proceedings international symposium on databases in parallel and distributed systems

作者： Lakshmi, M.Seetha Yu, Philip S. IBM T J Watson Research Cent Yorktown Heights NY USA

ISBN: (纸本)0818608935

Skew in the distribution of values taken by an attribute is identified as a major factor that can affect the performance of parallel architectures for relational joins. The effect of skew on the performance of two parallel architectures is evaluated using analytic models. In one architecture, called database machine (DBMC), data as well as processing power are distributed;while in the other architecture, called single processor parallel input/output (SPPI), data is distributed but the processing power is concentrated in one processor. The two architectures are compared in terms of the ratio of MIPS (millions of instructions per second) used by DBMC and SPPI to deliver the same throughput and response time. In addition, the horizontal growth potential of DBMC is evaluated in terms of maximum speedup achievable by DBMC relative to SPPI response time. The MIPS ratio as well as speedup are found to be very sensitive to the amount of skew. These suggest that careful thought should be given in parallelizing database applications and in the design of algorithms and query optimizer for parallel architectures.

关键词： Computer systems, Digital

来源：评论

学校读者我要写书评

暂无评论

Efficient, Chunk-Replicated Node Partitioned Data Warehouses

Efficient, Chunk-Replicated Node Partitioned Data Warehouses

引用

IEEE international symposium on parallel and distributed Processing with Applications

作者： Furtado, Pedro Univ Coimbra P-3000 Coimbra Portugal

ISBN: (纸本)9780769534718

Much has been said about processing efficiently data in parallel database servers, and some data warehouse applications must process in the order of tens to hundreds of Gigabytes efficiently. Yet, there is no effective approach targeted at using non-dedicated low-cost plaforms efficiently in this context. Imagine taking together 10 or 1000 commodity PCs and setting-up a data crunching platform for large database-resident data with acceptable performance. There are significant inter-related data layout and processing challenges when the computational, storage and network hardware are heterogeneous and slow. We propose how to place, replicate and load-balance the data efficiently in this context. This work innovates in several respects: being practically as fast as full-mirroring without its overhead, exploring schema, chunk-wise placement, replication and load-balanced processing to be faster and more flexible than previous efforts. Our findings are complemented by an evaluation using TPC-H performance benchmark queries.

关键词： parallel databases performance parallel databases Data warehousing Load balancing Fasting Heterogeneous

来源：评论

学校读者我要写书评

暂无评论

SparkScore: Leveraging Apache Spark for distributed Genomic Inference 30

SparkScore: Leveraging Apache Spark for Distributed Genomic ...

引用

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

作者： Bahmani, Amir Sibley, Alexander B. Parsian, Mahmoud Owzar, Kouros Mueller, Frank North Carolina State Univ Dept Comp Sci Raleigh NC 27695 USA Duke Univ Sch Med Duke Canc Inst Durham NC USA Illumina Santa Clara CA USA

ISBN: (纸本)9781509036820

The method of the efficient score statistic is used extensively to conduct inference for high throughput genomic data due to its computational efficiency and ability to accommodate simple and complex phenotypes. Inference based on these statistics can readily incorporate a priori knowledge from a vast collection of bioinformatics databases to further refine the analyses. The sampling distribution of the efficient score statistic is typically approximated using asymptotics. As this may be inappropriate in the context of small study size, or uncommon or rare variants, resampling methods are often used to approximate the exact sampling distribution. We propose SparkScore, a set of distributed computational algorithms implemented in Apache Spark, to leverage the embarrassingly parallel nature of genomic resampling inference on the basis of the efficient score statistics. We illustrate the application of this computational approach for the analysis of data from genome-wide analysis studies (GWAS). This computational approach also harnesses the fault-tolerant features of Spark and can be readily extended to analysis of DNA and RNA sequencing data, including expression quantitative trait loci (eQTL) and phenotype association studies.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

A parallel Tiled Solver for Dense Symmetric Indefinite systems on Multicore Architectures

A Parallel Tiled Solver for Dense Symmetric Indefinite Syste...

引用

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

作者： Baboulin, Marc Becker, Dulceneia Dongarra, Jack Inria Saclay Ile de France F-91893 Orsay France Univ Paris Sud F-91405 Orsay France Univ Tennessee Knoxville TN 37996 USA Oak Ridge Natl Lab Oak Ridge TN USA Univ Manchester Manchester Lancs England

ISBN: (纸本)9780769546759

We describe an efficient and innovative parallel tiled algorithm for solving symmetric indefinite systems on multicore architectures. This solver avoids pivoting by using a multiplicative preconditioning based on symmetric randomization. This randomization prevents the communication overhead due to pivoting, is computationally inexpensive and requires very little storage. Following randomization, a tiled factorization is used that reduces synchronization by using static or dynamic scheduling. We compare Gflop/s performance of our solver with other types of factorizations on a current multicore machine and we provide tests on accuracy using LAPACK test cases.

关键词： dense linear algebra symmetric indefinite systems randomized algorithms tiled factorization

来源：评论

学校读者我要写书评

暂无评论

distributed systems with Wireless Sensor Networks

Distributed Systems with Wireless Sensor Networks

引用

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

作者： Rodriguez, Noemi Rossetto, Silvana Catolica Univ Rio de Janeiro PUC Rio Dept Informat Rio De Janeiro Brazil Univ Fed Rio de Janeiro DCC Rio de Janeiro Brazil

ISBN: (纸本)9780769546766

Conventional distributed system courses follow a syllabus in which a list of topics is discussed independently and at different levels of abstractions. We propose to use a wireless sensor network environment to pin all topics down to concrete applications and to maintain issues such as fault tolerance and coordination continuously present. We describe a syllabus with eight conceptual modules, each of them associated to a hands-on experience with wireless sensor networks, which may be assigned either as homework or as a hands-on class, depending on the number of classroom hours that are available.

关键词： cross-cutting concerns distributed systems wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

distributed Receding Horizon Prediction in Linear Multisensor Stochastic systems

Distributed Receding Horizon Prediction in Linear Multisenso...

引用

IEEE international symposium on Industrial Electronics (ISIE 2009)

作者： Song, Il Young Song, Ha Ryon Shin, Vladimir Gwangju Inst Sci & Technol Sch Informat & Mechatron Kwangju South Korea

ISBN: (纸本)9781424443475

This paper is concerned with distributed receding horizon prediction for continuous-time linear stochastic systems with multiple sensors. A distributed fusion with the weighted sum structure is applied to the optimal local receding horizon predictors. The distributed prediction algorithm represents the optimal linear fusion by weighting matrices under the minimum mean square criterion. The algorithm has the parallel structure and allows parallel processing of observations making it reliable since the rest faultless sensors can continue to the fusion estimation if some sensors occur faulty. The derivation of equations for error cross-covariances between the local predictors is the key of this paper. Example demonstrates effectiveness of the distributed receding horizon predictor.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Crowdsourcing under Real-Time Constraints

Crowdsourcing under Real-Time Constraints

引用

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

作者： Boutsis, Ioannis Kalogeraki, Vana Athens Univ Econ & Business Dept Informat Athens Greece

ISBN: (纸本)9780769549712

In the recent years we are experiencing the rapid growth of crowdsourcing systems, in which "human workers" are enlisted to perform tasks more effectively than computers, and get compensated for the work they provide. The common belief is that the wisdom of the "human crowd" can greatly complement many computer tasks which are assigned to machines. A significant challenge facing these systems is determining the most efficient allocation of tasks to workers to achieve successful completion of the tasks under real-time constraints. This paper presents REACT, a crowdsourcing system that seeks to address this challenge and proposes algorithms that aim to stimulate user participation and handle dynamic task assignment and execution in the crowdsourcing system. The goal is to determine the most appropriate workers to assign incoming tasks, in such a way so that the real-time demands are met and high quality results are returned. We empirically evaluate our approach and show that REACT meets the requested real-time demands, achieves good accuracy, is efficient, and improves the amount of successful tasks that meet their deadlines up to 61% compared to traditional approaches like AMT.

关键词： distributed systems crowdsourcing real-time

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 16 17 18 19 20 21 22 23 24 25 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：