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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

语言

512 篇 英文
1 篇 其他

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

共 513 条记录，以下是31-40 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

proceedings of the IEEE symposium on Reliable distributed systems

Proceedings of the IEEE Symposium on Reliable Distributed Sy...

引用

33rd IEEE international symposium on Reliable distributed systems, SRDS 2014

ISBN: (纸本)9781479955848

The proceedings contain 45 papers. The topics discussed include: Gemini: an emergency line of defense against phishing attacks;a practical experience on the impact of plugins in web security;improving cloud service resilience using brownout-aware load-balancing;the performance of paxos in the cloud;transfer as a service: towards a cost-effective model for multi-site cloud data management;optimistic parallel state-machine replication;ZooFence: principled service partitioning and application to the ZooKeeper coordination service;make the leader work: executive deferred update replication;on the support of versioning in distributed key-value stores;transaction management using causal snapshot isolation in partially replicated databases;and exploiting decoding computational locality to improve the I/O performance of an XOR-coded storage cluster under concurrent failures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Compactor : Optimization Framework at Staging I/O nodes 28

Compactor : Optimization Framework at Staging I/O nodes

引用

28th IEEE international parallel & distributed Processing symposium Workshops (IPDPSW)

作者： Venkatesan, Vishwanath Chaarawi, Mohamad Koziol, Quincey Gabriel, Edgar Univ Houston Dept Comp Sci Houston TX 77204 USA HDF Grp Champaign IL USA

ISBN: (纸本)9781479941162

Data-intensive applications are largely influenced by I/O performance on HPC systems and the scalability of such applications to exascale primarily depends on the scalability of the I/O performance on HPC systems in the future. To mitigate the I/O performance, recent HPC systems make use of staging nodes to delegate I/O requests and in-situ data analysis. In this paper, we present the Compactor framework and also present three optimizations to improve I/O performance at the data staging nodes. The first optimization performs collective buffering across requests from multiple processes. In the second optimization, we present a way to steal writes to service read request at the staging node. Finally, we also provide a way to "morph" write requests from the same process. All optimizations were implemented as a part of the Exascale FastForward I/O stack. We evaluated the optimizations over a PVFS2 file system using a micro-benchmark and Flash I/O benchmark. Our results indicate significant performance benefits with our framework. In the best case the compactor is able to provide up to 70% improvement in performance.

关键词： parallel I/O Staging I/O Optimizations Exascale FastForward I/O

来源：评论

学校读者我要写书评

暂无评论

17th East European conference on advances in databases and information systems, ADBIS 2013

17th East European conference on advances in databases and i...

引用

17th East European Conference on Advances in databases and Information systems, ADBIS 2013

ISBN: (纸本)9783319018621

The proceedings contain 51 papers. The special focus in this conference is ADBIS Short Contributions, Special Session on Big Data: New Trends and Applications, The second international Workshop on GPUs in databases, The second international Workshop on Ontologies Meet Advanced Information systems, The First international Workshop on Social Business Intelligence: Integrating Social Content in Decision Making and Doctoral Consortium. The topics include: New Trends in databases and information systems;New trends in databases and information systems;New ontological alignment system based on a non-monotonic description logic;spatiotemporal co-occurrence rules;An efficient spatial access method for highly redundant point data;Labeling association rule clustering through a genetic algorithm approach, Time series queries processing with GPU support;Rule-based multi-dialect infrastructure for conceptual problem solving over heterogeneous distributed information resources;distributed processing of Xpath queries using mapreduce;A Query language for workflow instance data;When too similar is bad;Viable systems model based information flows;On materializing paths for faster recursive querying;XSLTmark II - a simple, extensible and portable XSLT benchmark;ReMoSSA;DSD;Designing parallel relational data warehouses;Big data new frontiers;Extraction, sentiment analysis and visualization of massive public messages;Desidoo, a big-data application to join the online and real-world marketplaces;GraphDB - storing large graphs on secondary memory;Hadoop on a low-budget general purpose hpc cluster in academia and Discovering contextual association rules in relational databases.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MTracer: A Trace-Oriented Monitoring Framework for Medium-Scale distributed systems

MTracer: A Trace-Oriented Monitoring Framework for Medium-Sc...

引用

2014 IEEE 8th international symposium on Service Oriented System Engineering

作者： Jingwen Zhou Zhenbang Chen Haibo Mi Ji Wang Science and Technology on Parallel and Distributed Processing Laboratory Changsha China

Trace-oriented runtime monitoring is a very effective method to improve the reliability of distributed systems. However, for medium-scale distributed systems, existing trace-oriented monitoring frameworks are either not powerful or efficient enough, or too complex and expensive to deploy and maintain. In this paper, we present MTracer, which is a lightweight trace-oriented monitoring system for medium-scale distributed systems. We have proposed and implemented several optimizations to improve the efficiency of the monitor server in MTracer. A web-based frontend is also provided to visualize a monitored system from different perspectives. We have validated MTracer in a real medium-scale environment. The results indicate that MTracer has a very lower overhead, and can handle more than 4000 events per second.

关键词： Monitoring Servers Optimization databases Runtime Data mining Reliability

来源：评论

学校读者我要写书评

暂无评论

Efficient pseudorecursive evaluation schemes for non-adaptive sparse grids 1

引用

2nd Workshop on Sparse Grids and Applications, SGA 2012

作者： Buse, Gerrit Pflüger, Dirk Jacob, Riko TU München München Germany Institute for Parallel and Distributed Systems Universität Stuttgart Stuttgart Germany ETH Zurich Zurich Switzerland

ISBN: (数字)9783319045375

ISBN: (纸本)9783319045368

In this work we propose novel algorithms for storing and evaluating sparse grid functions, operating on regular (not spatially adaptive), yet potentially dimensionally adaptive grid types. Besides regular sparse grids our approach includes truncated grids, both with and without boundary grid points. Similar to the implicit data structures proposed in Feuersänger (Dünngitterverfahren für hochdimensionale elliptische partielle Differntialgleichungen. Diploma Thesis, Institut für Numerische Simulation, Universität Bonn, 2005) and Murarasu et al. (proceedings of the 16th ACM symposium on Principles and Practice of parallel Programming. Cambridge University Press, New York, 2011, pp. 25–34) we also define a bijective mapping from the multi-dimensional space of grid points to a contiguous index, such that the grid data can be stored in a simple array without overhead. Our approach is especially well-suited to exploit all levels of current commodity hardware, including cache-levels and vector extensions. Furthermore, this kind of data structure is extremely attractive for today’s real-time applications, as it gives direct access to the hierarchical structure of the grids, while outperforming other common sparse grid structures (hash maps, etc.) which do not match with modern compute platforms that well. For dimensionality d ≤10 we achieve good speedups on a 12 core Intel Westmere-EP NUMA platform compared to the results presented in Murarasu et al. (proceedings of the international Conference on Computational Science—ICCS 2012. Procedia Computer Science, 2012). As we show, this also holds for the results obtained on Nvidia Fermi GPUs, for which we observe speedups over our own CPU implementation of up to 4.5 when dealing with moderate dimensionality. In high-dimensional settings, in the order of tens to hundreds of dimensions, our sparse grid evaluation kernels on the CPU outperform any other known implementation. © Springer international Publishing Switzerland 2014.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Teaching concurrent and distributed computing-Initiatives in Rio de Janeiro

Teaching concurrent and distributed computing-Initiatives in...

引用

2013 IEEE 37th Annual Computer Software and Applications Conference, COMPSAC 2013

作者： Branco, Adriano Moura, Ana Lucia De Rodriguez, Noemi Rossetto, Silvana Rio de Janeiro Brazil Rio de Janeiro Brazil

ISBN: (纸本)9780769549798

In this paper we describe two ongoing initiatives for teaching concurrency and distribution in PUC-Rio and UFRJ. One of them is a new approach for teaching distributed systems. Conventional distributed system courses follow a syllabus in which a list of topics is discussed independently and at different levels of abstractions. In Edupar'2012, we proposed a course with a novel approach, using 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. The second initiative is a smaller one, in which we insert a new topic in a systems Software course to allow students to have a better understanding of what is application-level multitasking and of how it can be implemented. In this paper, we report on the experience of teaching the proposed syllabus and the adjustments that were necessary. We also discuss some plans for the courses in 2013. © 2013 IEEE.

关键词： Teaching

来源：评论

学校读者我要写书评

暂无评论

HPC system software for regular and irregular parallel applications

HPC system software for regular and irregular parallel appli...

引用

2013 IEEE 37th Annual Computer Software and Applications Conference, COMPSAC 2013

作者： Morari, Alessandro Valero, Mateo Barcelona Supercomputing Center Barcelona Spain Universitat Politecnica de Catalunya Barcelona Spain

ISBN: (纸本)9780769549798

The upcoming generation of system software for High Performance Computing is expected to provide a richer set of functionalities without compromising application performance. This Ph.D. thesis addresses the problem of designing scalable system software for both regular and irregular applications. The contributions are two-fold. First, we evaluate the drawbacks of current HPC system software for regular applications. We describe a methodology to precisely measure jitter on a general-purpose OS. Considering a lightweight operating system (IBM CNK), we analyze the overhead of adding support for a missing feature such as dynamic memory management. second, we focus on irregular applications and build a specialized runtime system to enhance this kind of applications on common HPC flop intensive systems. The proposed runtime system provides a global address space abstraction of a distributed memory machine combined with a transparent fork/join execution model and it also includes lightweight multithreading and network message aggregation. © 2013 IEEE.

关键词： Jitter

来源：评论

学校读者我要写书评

暂无评论

Accelerating all-to-All protein structures comparison with tmalign using a noc many-cores processor architecture

Accelerating all-to-All protein structures comparison with t...

引用

2013 IEEE 37th Annual Computer Software and Applications Conference, COMPSAC 2013

作者： Sharma, Anuj Papanikolaou, Antonis Manolakos, Elias S. Department of Informatics and Telecommunications University of Athens Athens Greece Institute of Communication and Computer Systems National Technical University Athens Greece

ISBN: (纸本)9780769549798

Computational challenges for the one-to-many and many-to-many protein structure comparison (PSC) problem are a result of several factors: constantly expanding large-size structural proteomics databases, high computational complexity of pair wise protein comparison algorithms, and the multitude of pair wise comparison approaches used in the field. Advances in processor architectures, such as manycore CPUs, have enabled them to support parallelism making them of interest in speeding up PSC techniques. We presentrckAlign, an implementation of the popularly used TM-AlignPSC algorithm, designed for the Single-Chip Cloud Computer(SCC), an experimental processor created by Intel Labs. We developed a skeleton library, rckskel, and implemented amaster-slaves variant of TM-Align to exploit the parallelism offered by the SCC. We evaluated rckAlign on the SCC and compared it with existing TM-Align software running on a dualcore AMD CPU (2.4 GHz) and on a single-core Intel P54CPentium CPU (800 MHz). We observed an 11-fold speedup relatively to the former and a 44-fold speedup relatively to the latter. A key aspect of the performance of rckAlign on the SCC, is the almost linear speedup achieved with the number of SCC cores used as slaves. The method presented can easily be applied to other PSC algorithms and extended to running multiple PSC algorithms within the same SCC chip. © 2013 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

On partitioning and reordering problems in a hierarchically parallel hybrid linear solver

On partitioning and reordering problems in a hierarchically ...

引用

2013 IEEE 37th Annual Computer Software and Applications Conference, COMPSAC 2013

作者： Yamazaki, Ichitaro Li, Xiaoye S. Rouet, Francois-Henry Ucar, Bora Electrical Engineering and Computer Science Department University of Tennessee Knoxville United States Computational Research Division Lawrence Berkeley National Laboratory United States ENSEEIHT-IRIT Lawrence Berkeley National Laboratory United States CNRS and LIP UMR CNRS-ENS-INRIA-UCBL Lyon France

ISBN: (纸本)9780769549798

PDSLin is a general-purpose algebraic parallel hybrid (direct/iterative) linear solver based on the Schur complement method. The most challenging step of the solver is the computation of a preconditioner based on the global Schur complement. Efficient parallel computation of the preconditioner gives rise to partitioning problems with sophisticated constraints and objectives. In this paper, we identify two such problems and propose hyper graph partitioning methods to address them. The first problem is to balance the work loads associated with different sub domains to compute the preconditioner. We first formulate an objective function and a set of constraints to model the preconditioner computation time. Then, to address these complex constraints, we propose a recursive hyper graph bisection method. The second problem is to improve the data locality during the parallel solution of a sparse triangular system with multiple sparse right-hand sides. We carefully analyze the objective function and show that it can be well approximated by a standard hyper graph partitioning method. Moreover, an ordering compatible with a post ordering of the sub domain elimination tree is shown to be very effective in preserving locality. To evaluate the two proposed methods in practice, we present experimental results using linear systems arising from some applications of our interest. First, we show that in comparison to a commonly-used nested graph dissection method, the proposed recursive hyper graph partitioning method reduces the preconditioner construction time, especially when the number of sub domains is moderate. This is the desired result since PDSLin is based on a two-level parallelization to keep the number of sub domains small by assigning multiple processors to each sub domain. We also show that our second proposed hyper graph method improves the data locality during the sparse triangular solution and reduces the solution time. Moreover, we show that partitioning time can be

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：