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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,925 篇 会议
282 篇 期刊文献
26 册 图书
1 篇 科技报告

馆藏范围

11,234 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

5,466 篇 工学
- 5,207 篇 计算机科学与技术...
- 2,309 篇 软件工程
- 885 篇 电气工程
- 573 篇 信息与通信工程
- 252 篇 控制科学与工程
- 221 篇 电子科学与技术（可...
- 137 篇 网络空间安全
- 91 篇 机械工程
- 60 篇 生物工程
- 58 篇 动力工程及工程热...
- 52 篇 生物医学工程（可授...
- 46 篇 环境科学与工程（可...
- 45 篇 仪器科学与技术
- 41 篇 安全科学与工程
- 40 篇 建筑学
- 40 篇 测绘科学与技术
- 34 篇 化学工程与技术
- 33 篇 土木工程
- 32 篇 交通运输工程
1,033 篇 理学
- 813 篇 数学
- 121 篇 系统科学
- 116 篇 统计学（可授理学、...
- 83 篇 物理学
- 70 篇 生物学
- 48 篇 化学
- 41 篇 地球物理学
988 篇 管理学
- 843 篇 管理科学与工程(可...
- 285 篇 工商管理
- 176 篇 图书情报与档案管...
57 篇 经济学
- 54 篇 应用经济学
36 篇 法学
26 篇 医学
21 篇 农学
9 篇 教育学
6 篇 文学
3 篇 艺术学
2 篇 军事学

主题

1,705 篇 concurrent compu...
1,583 篇 distributed comp...
1,152 篇 parallel process...
986 篇 computer science
963 篇 computational mo...
873 篇 computer archite...
860 篇 application soft...
725 篇 grid computing
598 篇 high performance...
591 篇 hardware
530 篇 processor schedu...
488 篇 computer network...
456 篇 resource managem...
428 篇 scalability
399 篇 costs
395 篇 bandwidth
394 篇 runtime
383 篇 parallel program...
367 篇 peer to peer com...
356 篇 delay

机构

47 篇 college of compu...
40 篇 institute of com...
30 篇 oak ridge natl l...
29 篇 ibm thomas j. wa...
25 篇 institute of com...
23 篇 inria
23 篇 oak ridge nation...
22 篇 school of comput...
21 篇 mathematics and ...
18 篇 argonne natl lab...
18 篇 department of co...
18 篇 department of co...
18 篇 tokyo institute ...
17 篇 department of co...
17 篇 georgia inst tec...
17 篇 iit dept comp sc...
16 篇 univ chinese aca...
16 篇 lawrence berkele...
16 篇 department of co...
15 篇 department of co...

作者

32 篇 dongarra jack
30 篇 jack dongarra
23 篇 p. sadayappan
21 篇 a. choudhary
21 篇 david a. bader
20 篇 maciejewski anth...
19 篇 feng wu-chun
18 篇 dhabaleswar k. p...
18 篇 hoefler torsten
17 篇 p. banerjee
17 篇 h. casanova
17 篇 bader david a.
17 篇 howard jay siege...
17 篇 schulz martin
17 篇 panda dhabaleswa...
15 篇 s.k. das
15 篇 h.j. siegel
15 篇 hai jin
14 篇 gopalakrishnan g...
14 篇 alexey lastovets...

语言

11,156 篇 英文
68 篇 其他
10 篇 中文

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

共 11234 条记录，以下是4451-4460 订阅

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

详细简洁

排序：

An adaptive framework for the execution of data-intensive MapReduce applications in the Cloud

An adaptive framework for the execution of data-intensive Ma...

引用

25th IEEE international parallel and distributed Processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Koehler, Martin Kaniovskyi, Yuriy Benkner, Siegfried University of Vienna Faculty of Computer Science Department of Scientific Computing Austria

ISBN: (纸本)9780769543857

Cloud computing technologies play an increasingly important role in realizing data-intensive applications by offering a virtualized compute and storage infrastructure that can scale on demand. A programming model that has gained a lot of interest in this context is MapReduce, which simplifies processing of large-scale distributed data volumes, usually on top of a distributed file system layer. In this paper we report on a self-configuring adaptive framework for developing and optimizing data-intensive scientific applications on top of Cloud and Grid computing technologies and the Hadoop framework. Our framework relies on a MAPE-K loop, known from autonomic computing, for optimizing the configuration of data-intensive applications at three abstraction layers: the application layer, the MapReduce layer, and the resource layer. By evaluating monitored resources, the framework configures the layers and allocates the resources on a per job basis. The evaluation of configurations relies on historic data and a utility function that ranks different configurations regarding to the arising costs. The optimization framework has been integrated in the Vienna Grid Environment (VGE), a service-oriented application development environment for providing applications on HPC systems, clusters and Clouds as services. An experimental evaluation of our framework has been undertaken with a data-analysis application from the field of molecular systems biology. © 2011 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

distributed-memory parallel algorithms for matching and coloring

Distributed-memory parallel algorithms for matching and colo...

引用

25th IEEE international parallel and distributed Processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Çatalyürek, Umit V. Dobrian, Florin Gebremedhin, Assefaw Halappanavar, Mahantesh Pothen, Alex Depts. of Biomedial Informatics and Electrical and Computer Engineering Ohio State University United States Conviva United States Department of Computer Science Purdue University United States Pacific Northwest National Laboratory United States

ISBN: (纸本)9780769543857

We discuss the design and implementation of new highly-scalable distributed-memory parallel algorithms for two prototypical graph problems, edge-weighted matching and distance-1 vertex coloring. Graph algorithms in general have low concurrency, poor data locality, and high ratio of data access to computation costs, making it challenging to achieve scalability on massively parallel machines. We overcome this challenge by employing a variety of techniques, including speculation and iteration, optimized communication, and randomization. We present preliminary results on weak and strong scalability studies conducted on an IBM Blue Gene/P machine employing up to tens of thousands of processors. The results show that the algorithms hold strong potential for computing at petascale. © 2011 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Hyperspectral data processing in a high performance computing environment: A parallel best band selection algorithm

Hyperspectral data processing in a high performance computin...

引用

25th IEEE international parallel and distributed Processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Robila, Stefan A. Busardo, Gerald Department of Computer Science Montclair State University Montclair NJ United States

ISBN: (纸本)9780769543857

Hyperspectral data are characterized by a richness of information unique among various visual representations of a scene by representing the information in a collection of grayscale images with each image corresponding to a narrow interval in the electromagnetic spectrum. Such detail allows for precise identification of materials in the scene and promises to support advances in imaging beyond the visible range. However, hyperspectral data are considerably large and cumbersome to process and efficient computing solutions based on high performance computing are needed. In this paper we first provide an overview of hyperspectral data and the current state of the art in the use of HPC for its processing. Next we discuss the concept of best band selection, a fundamental feature extraction problem in hyperspectral imagery that, besides exhaustive search has only non optimal solutions. We provide an elegant algorithm that performs an exhaustive search for the solution using a distributed, multicore environment and MPI in order to show how using such a solution provides significant improvement over traditional sequential platforms. Additional experiments on the robustness of the algorithm in terms of data and job sizes are also provided. © 2011 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Trusted computing Dynamic Attestation by Using Static Analysis based Behavior Model

Trusted Computing Dynamic Attestation by Using Static Analys...

引用

9th IEEE international symposium on parallel and distributed Processing with Applications Workshops (ISPAW)/ICASE/SGH/GSDP

作者： Yu, Fajiang Tang, Xianglei Yu, Yue Li, Tong Yang, Tong Wuhan Univ Sch Comp Wuhan 430072 Hubei Peoples R China Minist Educ China Key Lab Aerosp Informat Secur & Trusted Comp Beijing Peoples R China Zhejiang Provis Testing Inst Elect Prod Hangzhou 310012 Peoples R China

ISBN: (纸本)9780769544298

Current technology of trusted computing can not comply with the requirement of trusted behavior. One method for trusted computing dynamic attestation was proposed in this paper. This method uses the behavior model based on static analysis of binary code. One same source code may have several different binary versions, this paper proposed one method of building almost the same core function model for different binary versions. This paper also overcame the difficulty that some dynamic behaviors can not be obtained by static analysis. The paper also gave out some solutions of dynamic attestation for some complex programs, such as recursion program, library link program and multi threads program.

关键词： trusted computing dynamic attestation behavior model static analysis

来源：评论

学校读者我要写书评

暂无评论

Volunteer cloud computing: MapReduce over the internet

Volunteer cloud computing: MapReduce over the internet

引用

25th IEEE international parallel and distributed Processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Costa, Fernando Silva, Luis Dahlin, Michael CISUC Dept. of Informatics Engineering University of Coimbra Portugal Laboratory for Advanced Systems Research University of Texas Austin United States

ISBN: (纸本)9780769543857

Volunteer computing harnesses computing resources of machines from around the world to perform distributed independent tasks, following a master/worker model. Despite the recent increase in popularity and power in middleware such as BOINC, there are still several limitations in existing systems. Current research is oriented towards optimizing existing applications, while the number of active users and projects has reached a plateau. A programming paradigm that has been significantly popular and is used by several systems on the cloud is MapReduce. The main advantage of this paradigm is that it can be used to solve a vast amount of different problems, by breaking them into simple steps and taking advantage of distributed resources. Volunteer computing provides these resources, and although it cannot match the conditions offered by a cluster, it has other advantages that can be leveraged. In this paper, we try to increase the computational power of Volunteer computing systems by allowing more complex applications and paradigms such as MapReduce to be run, thus opening new avenues and possibilities for the use of computational devices scattered through the Internet. We created a BOINC prototype that can run MapReduce jobs (BOINC-MR), using a pull-model in which communication is always initiated by the client. By running experiments on a small cluster, with multiple variables, we were able to evaluate a few initial scenarios with this paradigm. We used a simple MapReduce application, word count, as proof of concept, just to demonstrate a typical execution. © 2011 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

parallel investigations of the dynamics of neural microcircuits

Parallel investigations of the dynamics of neural microcircu...

引用

2011 10th international symposium on parallel and distributed computing, ISPDC 2011

作者： Muntean, Ioan Lucian Joldos, Marius Ban, Ilinca Raluca Morariu, Iulia Maria Computer Science Department Technical University of Cluj-Napoca Romania

ISBN: (纸本)9780769545400

The advent of multicore and many core technologies opens new frontiers in computational sciences, making possible intensive computations on affordable computer systems. Our ongoing work is focused on the investigation of the suitability of many core and multicore systems to computational neuroscience simulations. We aim at providing a deeper understanding of the influence the various parallelisation techniques have on the dynamics of spiking neural microcircuits - as they show an almost chaotic behaviour. For that, we are developing a methodology for the evaluation of parallel implementations of biologically-based neural models and small world neural networks. Following our methodology, we designed a framework to assess the behaviour and performance of different parallel and sequential implementations of simulation models and techniques. We present first results obtained on multicore systems with OpenMP parallelisation of Hodgkin-Huxley based-models. © 2011 IEEE.

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

Efficiently computing tensor eigenvalues on a GPU

Efficiently computing tensor eigenvalues on a GPU

引用

25th IEEE international parallel and distributed Processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Ballard, Grey Kolda, Tamara Plantenga, Todd UC Berkeley Computer Science Department Berkeley CA United States Sandia National Laboratories Livermore CA United States

ISBN: (纸本)9780769543857

The tensor eigenproblem has many important applications, generating both mathematical and application-specific interest in the properties of tensor eigenpairs and methods for computing them. A tensor is an m-way array, generalizing the concept of a matrix (a 2-way array). Kolda and Mayo [1] have recently introduced a generalization of the matrix power method for computing real-valued tensor eigenpairs of symmetric tensors. In this work, we present an efficient implementation of their algorithm, exploiting symmetry in order to save storage, data movement, and computation. For an application involving repeatedly solving the tensor eigenproblem for many small tensors, we describe how a GPU can be used to accelerate the computations. On an NVIDIA Tesla C 2050 (Fermi) GPU, we achieve 318 Gflops/s (31% of theoretical peak performance in single precision) on our test data set. © 2011 IEEE.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

On the resilience of [distributed] eas against cheaters in Global computing platforms

On the resilience of [distributed] eas against cheaters in G...

引用

25th IEEE international parallel and distributed Processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Varrette, Sebastien Tantar, Emilia Bouvry, Pascal Research Unit University of Luxembourg 16 rue Richard Coudenhove Kalergi L-1359 Luxembourg

ISBN: (纸本)9780769543857

Global computing (GC) platforms such as BOINC [1] are nowadays considered as the most powerful distributed computing systems worldwide. Based on volunteer computing and various forms of incentives, such architecture also attract cheaters who seek to obtain rewards with little or no contribution to the system. Cheating can be modelized as alteration of output values produced by some or all tasks of the program beeing executed. In complement of generic approaches typically based on task duplication, this article focus on Algorithm-Based Fault Tolerance (ABFT) [2] technics where the fault tolerance scheme is tailored to the algorithm performed to make it resilient to a limited number of faults i.e. falsified results produced by cheaters in this case. More precisely, the ABFT aspects of distributed Evolutionary Algorithm (dEA) against cheaters in GC environment is studied. Our main contribution consists in the formal analysis of the impact of cheating faults on this context, together with a theoretical proof of convergence towards valid solutions despite the presence of malicious acts. Whereas the resilience of dEA against a simpler model of fault (i.e. crash faults) has been observed in the literature [3], [4], [5], [6], this study is the first to propose a theoretical proof of this behaviour, additionally against a more complex kind of fault. By the variety of problems addressed by EAs, this study will hopefully promote their usage in the future developments around GC platforms. © 2011 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

XML processing in the cloud: Large-scale digital preservation in small institutions

XML processing in the cloud: Large-scale digital preservatio...

引用

25th IEEE international parallel and distributed Processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Wittek, Peter Jacquin, Thierry Déjean, Hervé Chanod, Jean-Pierre Darányi, Sándor Swedish School of Library and Information Science University of Borås Borås Sweden Xerox Research Centre Europe Meylan France

ISBN: (纸本)9780769543857

Digital preservation deals with the problem of retaining the meaning of digital information over time to ensure its accessibility. The process often involves a workflow which transforms the digital objects. The workflow defines document pipelines containing transformations and validation checkpoints, either to facilitate migration for persistent archival or to extract metadata. The transformations, nevertheless, are computationally expensive, and therefore digital preservation can be out of reach for an organization whose core operation is not in data conservation. The operations described the document workflow, however, do not frequently reoccur. This paper combines an implementation-independent workflow designer with cloud computing to support small institution in their ad-hoc peak computing needs that stem from their efforts in digital preservation. © 2011 IEEE.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Hybrid OpenCL: Enhancing OpenCL for distributed processing

Hybrid OpenCL: Enhancing OpenCL for distributed processing

引用

9th IEEE international symposium on parallel and distributed Processing with Applications, ISPA 2011

作者： Aoki, Ryo Oikawa, Shuichi Nakamura, Takashi Miki, Satoshi Department of Computer Science University of Tsukuba Tsukuba Japan Fixstars Corporation Tokyo Japan

ISBN: (纸本)9780769544281

We have been developing Hybrid OpenCL, which enables the utilization of OpenCL devices by connecting them over the network. Hybrid OpenCL opens a gate to scale up OpenCL environments. By using Hybrid OpenCL, applications written in OpenCL can be easily ported to high performance cluster computers;thus, Hybrid OpenCL can provide more various distributed and parallel computing platforms. Hybrid OpenCL consists of two elements, a runtime system that provides the abstraction of OpenCL implementations and a bridge program that connects multiple OpenCL runtime systems over the network. This paper describes the design and implementation Hybrid OpenCL. Its performance for distributed processing is evaluated by using multiple nodes. The experimentation results show that the overhead introduced by Hybrid OpenCL is minimum and comparable with the combination of MPI and OpenCL. © 2011 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 442 443 444 445 446 447 448 449 450 451 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：