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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,437 篇 会议
108 篇 期刊文献
3 册 图书

馆藏范围

3,548 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,425 篇 工学
- 2,335 篇 计算机科学与技术...
- 1,551 篇 软件工程
- 465 篇 信息与通信工程
- 335 篇 电气工程
- 252 篇 控制科学与工程
- 185 篇 网络空间安全
- 179 篇 电子科学与技术（可...
- 41 篇 生物医学工程（可授...
- 34 篇 动力工程及工程热...
- 29 篇 机械工程
- 29 篇 建筑学
- 29 篇 生物工程
- 28 篇 安全科学与工程
- 25 篇 土木工程
- 23 篇 光学工程
- 22 篇 力学（可授工学、理...
- 20 篇 化学工程与技术
- 20 篇 交通运输工程
- 17 篇 环境科学与工程（可...
1,069 篇 理学
- 949 篇 数学
- 131 篇 统计学（可授理学、...
- 80 篇 系统科学
- 77 篇 物理学
- 37 篇 生物学
- 26 篇 化学
462 篇 管理学
- 363 篇 管理科学与工程(可...
- 231 篇 工商管理
- 123 篇 图书情报与档案管...
43 篇 经济学
- 43 篇 应用经济学
21 篇 法学
- 21 篇 社会学
15 篇 农学
14 篇 医学
11 篇 教育学
3 篇 文学
1 篇 军事学

主题

490 篇 parallel process...
381 篇 parallel process...
313 篇 concurrent compu...
294 篇 computer science
276 篇 distributed comp...
266 篇 distributed comp...
217 篇 parallel algorit...
163 篇 computer archite...
162 篇 application soft...
132 篇 computational mo...
130 篇 parallel program...
121 篇 costs
118 篇 hardware
110 篇 algorithm design...
110 篇 computer network...
108 篇 delay
107 篇 processor schedu...
88 篇 distributed proc...
84 篇 parallel archite...
78 篇 hypercubes

机构

13 篇 pacific northwes...
11 篇 ieee
9 篇 syracuse univ sy...
9 篇 georgia inst of ...
9 篇 department of co...
8 篇 new jersey inst ...
7 篇 ibm thomas j. wa...
7 篇 school of comput...
7 篇 purdue univ west...
7 篇 irisa rennes
6 篇 texas a&m univ c...
6 篇 univ of californ...
6 篇 michigan state u...
6 篇 univ of maryland...
6 篇 institute of com...
6 篇 ohio state univ ...
6 篇 carnegie mellon ...
5 篇 department of co...
5 篇 department of co...
5 篇 university of lu...

作者

14 篇 bader david a.
10 篇 li keqin
9 篇 zomaya albert y.
9 篇 prasanna viktor ...
9 篇 das sajal k.
8 篇 prasad sushil k.
8 篇 maciejewski anth...
8 篇 sussman alan
8 篇 sun xian-he
7 篇 ibarra oscar h.
7 篇 boukerche azzedi...
7 篇 casanova henri
7 篇 talbi el-ghazali
7 篇 panda dhabaleswa...
7 篇 olariu s.
7 篇 cai wentong
7 篇 ahmad ishfaq
7 篇 aluru srinivas
6 篇 pan yi
6 篇 dongarra jack

语言

3,544 篇 英文
3 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing"

共 3548 条记录，以下是511-520 订阅

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

详细简洁

排序：

Cache performance and efficiency factors of parallel data structures

Cache performance and efficiency factors of parallel data st...

引用

2012 10th ieee International symposium on parallel and distributed processing with Applications, ISPA 2012

作者： Dudás, Ákos Sándor, Juhász Department of Automation and Applied Informatics Budapest University of Technology and Economics Magyar Tudósok krt. 2 QB207 1117 Budapest Hungary

ISBN: (纸本)9780769547015

Multi-core CPUs are very efficient at executing multiple threads at the same time without significant performance penalty;this capability, however, results in increasing demand for the memory and the caches, which not only have to serve multiple parallel requests but also have to endure the consequences of parallel programming. The performance of parallel applications is not only limited by the CPU and the internal level of parallelism that the algorithms and data structures allow, but is also restricted by their memory characteristics. Altering the data structure for example to work with machine word-sized pointers required by atomic operations incurs additional cache misses, while a lock protecting a critical section not only consumes memory, but could also be responsible for increased memory traffic for cache-line invalidations when acquired or released. We investigate these effects and analyze the behavior of different parallelization mechanisms, both blocking and lock-free solutions, through the example of a basic data structure: a hash table. © 2012 ieee.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Banking on Decoupling: Budget-driven Sustainability for HPC Applications on EC2 Spot Instances

Banking on Decoupling: Budget-driven Sustainability for HPC ...

引用

31st ieee International symposium on Reliable distributed Systems (SRDS)

作者： Taifi, Moussa Temple Univ Comp & Informat Sci Dept Philadelphia PA 19122 USA

ISBN: (纸本)9780769547848;9781467323970

Cloud providers are auctioning their excess capacity using dynamically priced virtual instances. These spot instances provide significant savings compared to on-demand or fixed price instances. The users willing to use these resources are asked to provide a maximum bid price per hour, and the cloud provider runs the instances as long as the market price is below the user's bid price. By using such resources, the users are exposed explicitly to failures and need to adapt their applications to provide some level of fault tolerance. In this paper we expose the effect of bidding in the case of virtual HPC clusters composed of spot instances. We describe the interesting effect of uniform versus non-uniform bidding, in terms of failure rate and failure model. We propose an initial attempt to deal with the problem of predicting the runtime of a parallel application under various bidding strategies and various system parameters. We describe the relationship between bidding strategies and programming models. We build a preliminary optimization model that uses real price traces from Amazon Web Services as inputs, as well as instrumented values related to the processing and network capacities of clusters instances on the EC2 services. Our results show preliminary insights into the relationship between non-uniform bidding and application scaling strategies.

关键词： Spot Instances Cloud-based Fault Tolerance Cloud virtual clusters Auction-based cloud computing Decoupling parallel Programming Models Cost-aware Optimization models

来源：评论

学校读者我要写书评

暂无评论

Multi-core parallel algorithm for wyner-ziv video decoding

Multi-core parallel algorithm for wyner-ziv video decoding

引用

2012 10th ieee International symposium on parallel and distributed processing with Applications, ISPA 2012

作者： Corrales-García, Alberto Martínez, José Luis Fernández-Escribano, Gerardo Quiles, Francisco José Instituto de Investigación en Informática de Albacete Universidad de Castilla-La Mancha Avenida de España s/n 02071 Albacete Spain

ISBN: (纸本)9780769547015

Wyner-Ziv video coding paradigm provides a framework where most of complexity is moved from the encoder to the decoder. In this way, Wyner-Ziv coding support efficiently multimedia services for low complexity devices which have to capture, encode and send video. Aplications such as mobile phones, sensor, Personal Digital Assistant (PDA) could benefice to this paradigm. On contraty to tradicional video paradigms, the complexity of the decoder is quite high and it should be reduced. This work presents a parallel Wyner-Ziv decoding algorithm in aims to reduce its high complexity. The present approach efficiently distribute the burden of the complexity over the number of cores which are available in the architecture. By using this parallel approach, the decoding time is reduced around 73%. The proposed methods are scalable for any multicore architecture and adaptable for different Wyner-Ziv decoding schemes. © 2012 ieee.

关键词： Multimedia services

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Incorporating business intelligence in cloud marketplaces

Incorporating business intelligence in cloud marketplaces

引用

2012 10th ieee International symposium on parallel and distributed processing with Applications, ISPA 2012

作者： Gatzioura, Anna Menychtas, Andreas Moulos, Vrettos Varvarigou, Theodora Distributed Knowledge and Media Systems Laboratory National Technical University of Athens Athens Greece

ISBN: (纸本)9780769547015

Cloud computing has changed considerably the architecture of modern IT systems introducing new design principles based on the notion of the service as main building unit. Decoupling the service offering from the underlying infrastructure, cloud computing allows for more efficient management of the required resources which in business level is translated into higher flexibility and increased profit. To this end, Clouds are not only an innovative technological environment but also a beneficial market for all the involved stakeholders. This market expands continuously and new service aggregations, customizations and business models are offered in order to cover the needs of all end-users. However, even in this new business ecosystem, the question still remains: "Which offering should I buy"? In this paper we present an approach for incorporating business intelligence in cloud marketplaces through a mechanism for answering this question based on the individual requirements and use profile of each particular cloud customer. © 2012 ieee.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Profiling Data-Dependence to Assist parallelization: Framework, Scope, and Optimization 45

Profiling Data-Dependence to Assist Parallelization: Framewo...

引用

45th ieee/ACM Annual International symposium on Microarchitecture (MICRO)

作者： Ketterlin, Alain Clauss, Philippe INRIA Paris France

ISBN: (纸本)9780769549248;9781467348195

This paper describes a tool using one or more executions of a sequential program to detect parallel portions of the program. The tool, called Parwiz, uses dynamic binary instrumentation, targets various forms of parallelism, and suggests distinct parallelization actions, ranging from simple directive tagging to elaborate loop transformations. The first part of the paper details the link between the program's static structures (like routines and loops), the memory accesses performed by the program, and the dependencies that are used to highlight potential parallelism. This part also describes the instrumentation involved, and the general architecture of the system. The second part of the paper puts the framework into action. The first study focuses on loop parallelism, targeting OpenMP parallel-for directives, including privatization when necessary. The second study is an adaptation of a well-known vectorization technique based on a slightly richer dependence description, where the tool suggests an elaborate loop transformation. The third study views loops as a graph of (hopefully lightly) dependent iterations. The third part of the paper explains how the overall cost of data-dependence profiling can be reduced. This cost has two major causes: first, instrumenting memory accesses slows down the program, and second, turning memory accesses into dependence graphs consumes processing time. Parwiz uses static analysis of the original (binary) program to provide data at a coarser level, moving from individual accesses to complete loops whenever possible, thereby reducing the impact of both sources of inefficiency.

关键词： parallel programming program diagnostics

来源：评论

学校读者我要写书评

暂无评论

Avoiding serialization effects in data / dependency aware task parallel algorithms for spatial decomposition

Avoiding serialization effects in data / dependency aware ta...

引用

2012 10th ieee International symposium on parallel and distributed processing with Applications, ISPA 2012

作者： Niethammer, Christoph Glass, Colin W. Gracia, Jose High Performance Computing Center Stuttgart University of Stuttgart Germany

ISBN: (纸本)9780769547015

Spatial decomposition is a popular basis for parallelising code. Cast in the frame of task parallelism, calculations on a spatial domain can be treated as a task. If neighbouring domains interact and share results, access to the specific data needs to be synchronized to avoid race conditions. This is the case for a variety of applications, like most molecular dynamics and many computational fluid dynamics codes. Here we present an unexpected problem which can occur in dependency-driven task parallelization models like StarSs: the tasks accessing a specific spatial domain are treated as interdependent, as dependencies are detected automatically via memory addresses. Thus, the order in which tasks are generated will have a severe impact on the dependency tree. In the worst case, a complete serialization is reached and no two tasks can be calculated in parallel. We present the problem in detail based on an example from molecular dynamics, and introduce a theoretical framework to calculate the degree of serialization. Furthermore, we present strategies to avoid this unnecessary problem. We recommend treating these strategies as best practice when using dependency-driven task parallel programming models like StarSs on such scenarios. © 2012 ieee.

关键词： Molecular dynamics

来源：评论

学校读者我要写书评

暂无评论

Evaluating the performance of a parallel multiobjective artificial bee colony algorithm for inferring phylogenies on multicore architectures

Evaluating the performance of a parallel multiobjective arti...

引用

2012 10th ieee International symposium on parallel and distributed processing with Applications, ISPA 2012

作者： Santander-Jiménez, Sergio Vega-Rodríguez, Miguel A. Gómez-Pulido, Juan A. Sánchez-Pérez, Juan M. University of Extremadura Department of Technologies of Computers and Communications ARCO Research Group 10003. Cáceres Spain

ISBN: (纸本)9780769547015

A wide variety of optimization problems requires the combination of Bioinspired and parallel Computing to address the complexity needed to get optimal solutions in reduced times. The multicore era allows the researcher to exploit modern arqitectures to resolve these NP-Hard problems. Inferring phylogenetic trees which describe a hypothesis of the evolution of species is a well-known example of this kind of problems. As the space of possible tree topologies increases exponentially with the number of species, exhaustive searches cannot be applied. Also, additional difficulties arise when we must consider simultaneously multiple optimality measures to resolve the problem. In this paper, we report a performance study on multicore machines of a parallel multiobjective adaptation of the Artificial Bee Colony algorithm for inferring phylogenies according to the maximum parsimony and maximum likelihood criteria. Experimental results reveal that our proposal can improve other approaches based on advanced High Performance Computing techniques on large data sets. © 2012 ieee.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

parallel Decoding of LDPC Convolutional Codes Using OpenMP and GPU

Parallel Decoding of LDPC Convolutional Codes Using OpenMP a...

引用

17th ieee symposium on Computers and Communications (lSCC)

作者： Chan, Chi H. Lau, Francis C. M. Hong Kong Polytech Univ Dept Elect & Informat Engn Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781467327138

Recently, there have been different applications, namely 10GBase-T Ethernet, video broadcasting and satellite communication, utilizing low-density parity-check (LDPC) codes as the forward-error-correction codes. The main reason is that the error performance of LDPC codes can be very close to the Shannon limit. LDPC codes can be further categorized into LDPC block codes (LDPC-BCs) and LDPC convolutional codes (LDPC-CCs). It has also been discovered that LDPC-CCs usually outperform LDPC-BCs. Simulation of LDPC-BCs and LDPC-CCs can take a lot of time because the decoding algorithms are relatively complex. Fortunately, the decoding steps can be performed in parallel. In this paper, we create three different platforms for simulating the error performance of LDPC-CCs. The first two platforms are run on a Central processing Unit (CPU) while the third one involves the use of a Graphics processing Unit (GPU). We show that using GPU can improve the simulation speed substantially.

关键词： CPU error performance GPU LDPC code LDPC convolutional code

来源：评论

学校读者我要写书评

暂无评论

A comparative evaluation of parallel programming models for shared-memory architectures

A comparative evaluation of parallel programming models for ...

引用

2012 10th ieee International symposium on parallel and distributed processing with Applications, ISPA 2012

作者： Sanchez, Luis Miguel Fernandez, Javier Sotomayor, Rafael Garcia, J. Daniel Computer Architecture and Technology Area Computer Science Department Universidad Carlos III De Madrid Madrid Colmenarejo 28270 Spain

ISBN: (纸本)9780769547015

Nowadays, most computers that are commercially available off-the-shelf (COTS) include hardware features that increase the performance of parallel general-purpose threads (hyper threading, multicore, ccNUMA architectures) or SIMD kernels (CPU vector instructions, GPUs). The purpose of this paper is to perform a compared evaluation of several parallel programming models where each one is fitted to exploit some of these features but also each one requires a different level of programming skills. Four parallel programming models (OpenMP, Intel TBB, Intel ArBB, and CUDA) have been selected. The idea is to cover a wide spectrum of programming models and most of the parallel hardware features included in modern computers. On one hand, OpenMP and TBB platforms, that exploit parallel threads running on multicore systems. On the other hand, ArBB, that combines muticore parallel threads and multicore SIMD features with a simpler programming model, and CUDA that exploits SIMD features of the GPU hardware. Our results obtained with the benchmarks used on this paper suggest that OpenMP and TBB have a lower performance compared to ArBB and CUDA. But also that ArBB performance tends to be comparable with CUDA performance in most cases (although it is normally lower). Thus, there are evidences that a careful designed top range multicore and multisocket architecture, can be comparable in terms of performance with top range GPU cards for many applications, with the advantage of a simpler programming model. © 2012 ieee.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共355页 << < 48 49 50 51 52 53 54 55 56 57 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：