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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

450 篇 会议
9 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

363 篇 工学
- 347 篇 计算机科学与技术...
- 207 篇 软件工程
- 70 篇 电气工程
- 58 篇 信息与通信工程
- 28 篇 电子科学与技术（可...
- 23 篇 控制科学与工程
- 10 篇 网络空间安全
- 9 篇 石油与天然气工程
- 3 篇 动力工程及工程热...
- 3 篇 生物医学工程（可授...
- 3 篇 安全科学与工程
- 2 篇 力学（可授工学、理...
- 2 篇 机械工程
- 2 篇 光学工程
- 2 篇 土木工程
- 2 篇 化学工程与技术
127 篇 理学
- 108 篇 数学
- 19 篇 统计学（可授理学、...
- 14 篇 物理学
- 8 篇 系统科学
- 4 篇 生物学
- 3 篇 化学
- 2 篇 地球物理学
43 篇 管理学
- 34 篇 管理科学与工程(可...
- 17 篇 工商管理
- 9 篇 图书情报与档案管...
4 篇 医学
- 4 篇 基础医学(可授医学...
- 3 篇 临床医学
- 2 篇 公共卫生与预防医...
3 篇 法学
- 3 篇 社会学
1 篇 经济学
1 篇 教育学

主题

58 篇 parallel process...
37 篇 distributed comp...
34 篇 concurrent compu...
32 篇 computer science
26 篇 distributed comp...
25 篇 parallel process...
24 篇 parallel algorit...
22 篇 computer archite...
20 篇 computational mo...
18 篇 hardware
16 篇 algorithm design...
14 篇 application soft...
13 篇 parallel program...
12 篇 hypercubes
12 篇 costs
12 篇 computer network...
12 篇 delay
10 篇 grid computing
10 篇 processor schedu...
9 篇 fault tolerance

机构

5 篇 univ ottawa site...
4 篇 carleton univ sc...
4 篇 carleton univ ot...
3 篇 school of comput...
3 篇 purdue univ west...
3 篇 new jersey inst ...
3 篇 univ alberta dep...
3 篇 georgia inst of ...
3 篇 tohoku univ grad...
2 篇 univ adelaide sc...
2 篇 graduate school ...
2 篇 univ nacl autono...
2 篇 department of el...
2 篇 syracuse univ sy...
2 篇 site university ...
2 篇 univ of texas at...
2 篇 univ paris 06 so...
2 篇 school of comput...
2 篇 queens univ dept...
2 篇 dept. of electri...

作者

5 篇 afsahi ahmad
5 篇 bouvry pascal
4 篇 boukerche azzedi...
4 篇 berenbrink petra
4 篇 takizawa hiroyuk...
3 篇 sens pierre
3 篇 malek miroslaw
3 篇 petit franck
3 篇 mirsadeghi seyed...
3 篇 solomonik edgar
3 篇 nayak amiya
3 篇 sato mitsuhisa
3 篇 friedetzky tom
3 篇 salfner felix
2 篇 chaudhary vipin
2 篇 boku taisuke
2 篇 melab nouredine
2 篇 santoro nicola
2 篇 wang jing
2 篇 narayanan lata

语言

459 篇 英文

检索条件"任意字段=Proceeedings of the 6th IEEE Symposium on Parallel and Distributed Processing"

共 459 条记录，以下是131-140 订阅

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

详细简洁

排序：

Investigating the impact of the Cielo Cray XE6 architecture on scientific application codes

Investigating the impact of the Cielo Cray XE6 architecture ...

引用

25th ieee International parallel and distributed processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Vaughan, Courtenay Rajan, Mahesh Barrett, Richard Doerfler, Doug Pedretti, Kevin Center for Computing Research Sandia National Laboratories MS 1319 P.O. Box 5800 Albuquerque NM 87185-1319 United States

ISBN: (纸本)9780769543857

Cielo, a Cray XE6, is the Department of Energy NNSA Advanced Simulation and Computing (ASC) campaign's newest capability machine. Rated at 1.37 PFLOPS, it consists of 8,944 dual-socket oct-core AMD Magny-Cours compute nodes, linked using Cray's Gemini interconnect. Its primary mission objective is to enable a suite of the ASC applications implemented using MPI to scale to tens of thousands of cores. Cielo is an evolutionary improvement to a successful architecture previously available to many of our codes, thus enabling a basis for understanding the capabilities of this new architecture. Using three codes strategically important to the ASC campaign, and supplemented with some micro-benchmarks that expose the fundamental capabilities of the XE6, we report on the performance characteristics and capabilities of Cielo. © 2011 ieee.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

distributed fine-grained access control in wireless sensor networks

Distributed fine-grained access control in wireless sensor n...

引用

25th ieee International parallel and distributed processing symposium, IPDPS 2011

作者： Ruj, Sushmita Nayak, Amiya Stojmenovic, Ivan SITE University of Ottawa Ottawa ON K1N 6N5 Canada

ISBN: (纸本)9780769543857

In mission-critical activities, each user is allowed to access some specific, but not all, data gathered by wireless sensor networks. Yu et al [1] recently proposed a centralized fine grained data access control mechanism for sensor networks, which exploits a cryptographic primitive called attribute based encryption (ABE). there is only one trusted authority to distribute keys to the sensor nodes and the users. Compromising the single authority can undermine the whole network. We propose a fully distributed access control method, which has several authorities instead of one. Each sensor has a set of attributes and each user has an access structure of attributes. A message from a sensor is encrypted such that only a user with matching set of attributes can decrypt. Compared to [1], our schemes need simpler access structure which make secret key distribution more computation efficient, when user rights are modified. We prove that our scheme can tolerate compromising all but one distribution centers, which independently distribute their contributions to a single user key. Our scheme do not increase the computation and communication costs of the sensors, making it highly desirable for fine grained access control. © 2011 ieee.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

distributed B&B: A pure peer-to-peer approach

Distributed B&B: A pure peer-to-peer approach

引用

25th ieee International parallel and distributed processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Djamaï, Mathieu Derbel, Bilel Melab, Nouredine Université des Sciences et Technologies de Lille Lille France

ISBN: (纸本)9780769543857

the state-of-the-art large scale approach for solving NP-hard permutation-based problems using parallel Branch-and-Bound (B&B) techniques is based on a Master-Slave model which is known to be limited in terms of scalability. In this paper, we present a new Peer-to-Peer (P2P) approach that can handle a huge amount of computational resources in a fully distributed way, that is without the need of any centralized coordinator. To achieve that, we propose simple and efficient fully distributed algorithms dealing with major parallel B&B issues such as work sharing, dynamic load balancing and termination detection. We argue that our P2P approach has a scalability which is exponentially better in theory compared to the Master-Slave technique while having a negligible communication overhead in a worst case-scenario, namely poly-logarithmic. the approach has been implemented and experimented using the Grid' 5000 nation-wide French grid. through extensive simulations involving up to 150 000 peers, we show that, compared to the state-of-the-art Master-Slave technique, our P2P approach enables (i) to improve the parallel efficiency up to a ratio of 6 to 1, (ii) to significantly speed up the B&B search process, namely by up to 7 factor in terms of number of solutions explored in the search space and, (iii) to keep the communication overhead relatively low, namely by a factor of at most 11 without penalizing the search process. © 2011 ieee.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

Fast community detection algorithm with GPUs and multicore architectures

Fast community detection algorithm with GPUs and multicore a...

引用

25th ieee International parallel and distributed processing symposium, IPDPS 2011

作者： Soman, Jyothish Narang, Ankur IBM Research India New Delhi India

ISBN: (纸本)9780769543857

In this paper, we present the design of a novel scalable parallel algorithm for community detection optimized for multi-core and GPU architectures. Our algorithm is based on label propagation, which works solely on local information, thus giving it the scalability advantage over conventional approaches. We also show that weighted label propagation can overcome typical quality issues in communities detected with label propagation. Experimental results on well known massive scale graphs such as Wikipedia (100M edges) and also on RMAT graphs with 10M - 40M edges, demonstrate the superior performance and scalability of our algorithm compared to the well known approaches for community detection. On the hep-th graph (352K edges) and the wikipedia graph (100M edges), using Power 6 architecture with 32 cores, our algorithm achieves one to two orders of magnitude better performance compared to the best known prior results on parallel architectures with similar number of CPUs. Further, our GPGPU based algorithm achieves 8x improvement over the Power 6 performance on 40M edge R-MAT graph. Alongside, we achieve high quality (modularity) of communities detected, with experimental evidence from well-known graphs such as Zachary karate club, Dolphin network and Football club, where we achieve modularity that is close to the best known alternatives. To the best of our knowledge these are best known results for community detection on massive graphs (100M edges) in terms of performance and also quality vs. performance trade-off. this is also a unique work on community detection on GPGPUs with scalable performance. © 2011 ieee.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

A new protocol to determine the NAT characteristics of a host

A new protocol to determine the NAT characteristics of a hos...

引用

25th ieee International parallel and distributed processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Holzapfel, Sebastian Wander, Matthäus Wacker, Arno Schwittmann, Lorenz Weis, Torben University of Duisburg-Essen Distributed Systems Group Bismarckstraße 90 47057 Duisburg Germany

ISBN: (纸本)9780769543857

the shortage of IPv4 addresses and the very slow transition to IPv6 leads to well-established pragmatic solutions in the Internet: today many hosts are still using IPv4 and are connected to the Internet over a Network Address Translation router. For many applications, which need inbound connections, like e.g. voice-over-IP or peer-to-peer-based systems it is necessary to determine the characteristics of the surrounding network environment, i.e. the behavior of the used router. In most cases this information is required to successfully establish inbound connections. therefore, we present in this paper a new protocol to determine the characteristics of the used router. Our protocol is backward compatible to the well known STUN protocol while providing more detailed results. Furthermore, our protocol can be used in a fully decentralized way, i.e. without any centralized servers, making it suitable for pure peer-to-peer-based systems. We complete the presentation of our new protocol with an evaluation through a field experiment. © 2011 ieee.

关键词： Routers

来源：评论

学校读者我要写书评

暂无评论

Deployment on GPUs of an application in computational atomic physics

Deployment on GPUs of an application in computational atomic...

引用

25th ieee International parallel and distributed processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Fortin, P. Habel, R. Jézéquel, F. Lamotte, J.-L. Scott, N.S. UPMC Univ Paris 06 UMR 7606 Laboratoire d'Informatique de Paris 6 4 place Jussieu 75252 Paris Cedex 05 France Télécom Sud Paris 9 rue Charles Fourier 91011 Evry Cedex France School of Electronics Electrical Engineering and Computer Science Queen's University of Belfast Belfast BT7 1NN United Kingdom

ISBN: (纸本)9780769543857

this paper describes the deployment on GPUs of PROP, a program of the 2DRMP suite which models electron collisions with H-like atoms and ions. Because performance on GPUs is better in single precision than in double precision, the numerical stability of the PROP program in single precision has been studied. the numerical quality of PROP results computed in single precision and their impact on the next program of the 2DRMP suite has been analyzed. Successive versions of the PROP program on GPUs have been developed in order to improve its performance. Particular attention has been paid to the optimization of data transfers and of linear algebra operations. Performance obtained on several architectures (including NVIDIA Fermi) are presented. © 2011 ieee.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Snap-stabilizing committee coordination

Snap-stabilizing committee coordination

引用

25th ieee International parallel and distributed processing symposium, IPDPS 2011

作者： Bonakdarpour, Borzoo Devismes, Stéphane Petit, Franck Department of Electrical and Computer Engineering University of Waterloo 200 University Avenue West Waterloo ON N2L 3G1 Canada VERIMAG UMR 5104 Grenoble 1 France LIP6 UPMC Paris 6 France

ISBN: (纸本)9780769543857

In this paper, we propose two snap-stabilizing distributed algorithms for the committee coordination problem. In this problem, a committee consists of a set of processes and committee meetings are synchronized, so that each process participates in at most one committee meeting at a time. Snap-stabilization is a versatile technique allowing to design algorithms that efficiently tolerate transient faults. Indeed, after a finite number of such faults (e.g. memory corruptions, message losses, etc), a snap-stabilizing algorithm immediately operates correctly, without any external intervention. We design snap-stabilizing committee coordination algorithms enriched with some desirable properties related to concurrency, (weak) fairness, and a stronger synchronization mechanism called 2-Phase Discussion Time}. From previous papers, we know that (1) in the general case, (weak) fairness cannot be achieved in the committee coordination, and (2) it becomes feasible provided that each process waits for meetings infinitely often. Nevertheless, we show that even under this latter assumption, it is impossible to implement a fair solution that allows maximal concurrency}. Hence, we propose two orthogonal snap-stabilizing algorithms, each satisfying 2-phase discussion time, and either maximal concurrency or fairness. the algorithm implementing fairness requires that every process waits for meetings infinitely often. Moreover, for this algorithm, we introduce and evaluate a new efficiency criterion called the degree of fair concurrency. this criterion shows that even if it does not satisfy maximal concurrency, our snap-stabilizing fair algorithm still allows a high level of concurrency. © 2011 ieee.

关键词： Stabilization

来源：评论

学校读者我要写书评

暂无评论

A Lightweight, Component-based Approach to Engineering Reconfigurable Embedded Real-Time Control Software

A Lightweight, Component-based Approach to Engineering Recon...

引用

9th ieee International symposium on parallel and distributed processing with Applications Workshops (ISPAW)/ICASE/SGH/GSDP

作者： Kwon, Jagun Hailes, Stephen UCL London WC1E 6BT England

ISBN: (纸本)9780769544298

the cost of poor or repeat engineering in complex control systems is extremely high, and flexibility in software design and implementation is one of the key factors in staying competitive in the market. Complexity can be managed most effectively if the underlying software systems support structured, standardised, high-level abstraction layers that encapsulate unnecessary details behind well-defined interfaces. Moreover, since the costs of software maintenance are often as high as that of initial development, the ease with which it is possible flexibly to reconfigure, re-engineer, and replace software components in operational systems is also critical. In this paper, we present a lightweight, component-based approach to engineering embedded real-time control software, which is realized in the form of a middleware system named MIREA. the middleware supports dynamic reconfiguration of components written in C/C++, and addresses variability management in relation to non-functional properties, such as quality-of-service (QoS) and real-time scheduling. Users are allowed to componentize existing libraries easily, such as the standard NIST 4D/Real-time Control Systems (RCS) library, which has been successfully used in many U.S government-driven intelligent control projects, and to reuse them as dynamically reconfigurable components. A realistic illustration is provided showing how control systems are structured and reconfigured using our approach. In fact, we discuss our approach to control using a fusion of NIST RCS as a means of architecting a real time control system and MIREA as a means of realising that architecture. Our progress to date suggests that MIREA is indeed well suited as a middleware facilitating the construction of efficient, lightweight, and scalable real-time embedded control systems.

关键词： Batteries Control systems Middleware Monitoring Real time systems Runtime Software

来源：评论

学校读者我要写书评

暂无评论

H-Code: A hybrid MDS array code to optimize partial stripe writes in RAID-6

H-Code: A hybrid MDS array code to optimize partial stripe w...

引用

25th ieee International parallel and distributed processing symposium, IPDPS 2011

作者： Wu, Chentao Wan, Shenggang He, Xubin Cao, Qiang Xie, Changsheng Department of Electrical and Computer Engineering Virginia Commonwealth University Richmond VA 23284 United States Wuhan National Lab. for Optoelectronics Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769543857

RAID-6 is widely used to tolerate concurrent failures of any two disks to provide a higher level of reliability with the support of erasure codes. Among many implementations, one class of codes called Maximum Distance Separable (MDS) codes aims to offer data protection against disk failures with optimal storage efficiency. Typical MDS codes contain horizontal and vertical codes. Due to the horizontal parity, in the case of partial stripe write (refers to I/O operations that write new data or update data to a subset of disks in an array) in a row, horizontal codes may get less I/O operations in most cases, but suffer from unbalanced I/O distribution. they also have limitation on high single write complexity. Vertical codes improve single write complexity compared to horizontal codes, while they still suffer from poor performance in partial stripe writes. In this paper, we propose a new XOR-based MDS array code, named Hybrid Code (H-Code), which optimizes partial stripe writes for RAID-6 by taking advantages of both horizontal and vertical codes. H-Code is a solution for an array of (p+1) disks, where p is a prime number. Unlike other codes taking a dedicated anti-diagonal parity strip, H-Code uses a special anti-diagonal parity layout and distributes the anti-diagonal parity elements among disks in the array, which achieves a more balanced I/O distribution. On the other hand, the horizontal parity of H-Code ensures a partial stripe write to continuous data elements in a row share the same row parity chain, which can achieve optimal partial stripe write performance. Not only within a row but also within a stripe, H-Code offers optimal partial stripe write complexity to two continuous data elements and optimal partial stripe write performance among all MDS codes to the best of our knowledge. Specifically, compared to RDP and EVENODD codes, H-Code reduces I/O cost by up to 15.54% and 22.17%. Overall, H-code has optimal storage efficiency, optimal encoding/decoding compu

关键词： Storage efficiency

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共46页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：