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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,645 篇 会议
54 篇 期刊文献
12 册 图书

馆藏范围

1,711 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,164 篇 工学
- 1,105 篇 计算机科学与技术...
- 417 篇 软件工程
- 162 篇 电气工程
- 128 篇 信息与通信工程
- 76 篇 电子科学与技术（可...
- 62 篇 控制科学与工程
- 18 篇 生物工程
- 18 篇 网络空间安全
- 17 篇 材料科学与工程（可...
- 14 篇 仪器科学与技术
- 14 篇 生物医学工程（可授...
- 12 篇 环境科学与工程（可...
- 11 篇 机械工程
- 11 篇 化学工程与技术
- 11 篇 安全科学与工程
- 10 篇 光学工程
- 10 篇 动力工程及工程热...
- 10 篇 交通运输工程
- 9 篇 力学（可授工学、理...
- 9 篇 建筑学
225 篇 理学
- 162 篇 数学
- 39 篇 物理学
- 23 篇 系统科学
- 22 篇 统计学（可授理学、...
- 20 篇 生物学
- 13 篇 化学
183 篇 管理学
- 150 篇 管理科学与工程(可...
- 41 篇 工商管理
- 39 篇 图书情报与档案管...
6 篇 医学
5 篇 法学
5 篇 农学
4 篇 经济学
2 篇 教育学
2 篇 艺术学
1 篇 军事学

主题

151 篇 parallel process...
106 篇 application soft...
91 篇 concurrent compu...
85 篇 distributed proc...
84 篇 computer archite...
83 篇 distributed comp...
78 篇 hardware
63 篇 computational mo...
61 篇 graphics process...
59 篇 parallel process...
58 篇 graphics process...
56 篇 computer science
55 篇 kernel
51 篇 instruction sets
50 篇 scalability
50 篇 bandwidth
48 篇 runtime
47 篇 resource managem...
43 篇 libraries
42 篇 multicore proces...

机构

8 篇 ohio state univ ...
7 篇 ibm thomas j. wa...
6 篇 georgia inst tec...
5 篇 shanghai jiao to...
5 篇 school of comput...
5 篇 univ manitoba de...
5 篇 georgia state un...
5 篇 oak ridge natl l...
5 篇 univ illinois de...
5 篇 st francis xavie...
4 篇 univ calif river...
4 篇 school of comput...
4 篇 iowa state univ ...
4 篇 college of compu...
4 篇 college of compu...
4 篇 virginia tech de...
3 篇 university of sc...
3 篇 department of co...
3 篇 chinese acad sci...
3 篇 oak ridge natl l...

作者

10 篇 yang laurence t.
8 篇 cappello franck
6 篇 agrawal gagan
6 篇 matsuoka satoshi
5 篇 bader david a.
5 篇 parashar manish
5 篇 panda dhabaleswa...
5 篇 sun xian-he
4 篇 snir marc
4 篇 frederic suter
4 篇 zheng wm
4 篇 yaobin wang
4 篇 tang tao
4 篇 yang ltr
4 篇 a. choudhary
4 篇 endo toshio
4 篇 kumar sameer
4 篇 kale laxmikant v...
4 篇 chen dan
4 篇 thakur rajeev

语言

1,636 篇 英文
71 篇 其他
4 篇 中文
1 篇 土耳其文

检索条件"任意字段=2nd International Symposium on Parallel and Distributed Processing and Applications"

共 1711 条记录，以下是921-930 订阅

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

详细简洁

排序：

Underlay awareness in P2P systems: Techniques and challenges

Underlay awareness in P2P systems: Techniques and challenges

引用

international symposium on parallel and distributed processing (IPDPS)

作者： Osama Abboud Aleksandra Kovacevic Kalman Graffi Konstantin Pussep Ralf Steinmetz Multimedia Communications Laboratory Technische Universität Darmstadt Germany

Peer-to-peer (P2P) applications have recently attracted a large number of Internet users. Traditional P2P systems however, suffer from inefficiency due to lack of information from the underlay, i.e. the physical network. Although there is a plethora of research on underlay awareness, this aspect of P2P systems is still not clearly structured. In this paper, we provide a taxonomic survey that outlines the different steps for achieving underlay awareness. The main contribution of this paper is presenting a clear picture of what underlay awareness is and how it can be used to build next generation P2P systems. Impacts of underlay awareness and open research issues are also discussed.

关键词： Costs Quality of service Peer to peer computing Kalman filters Multimedia communication Multimedia systems Web and internet services Large-scale systems Resource management Routing

来源：评论

学校读者我要写书评

暂无评论

Best-effort parallel execution framework for Recognition and mining applications

Best-effort parallel execution framework for Recognition and...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： Jiayuan Meng Srimat Chakradhar Anand Raghunathan Department of Computer Science University of Virginia Charlottesville VA USA NEC Laboratories of America Inc. Princeton NJ USA School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

ISBN: (纸本)9781424437511

Recognition and mining (RM) applications are an emerging class of computing workloads that will be commonly executed on future multi-core and many-core computing platforms. The explosive growth of input data and the use of more sophisticated algorithms in RM applications will ensure, for the foreseeable future, a significant gap between the computational needs of RM applications and the capabilities of rapidly evolving multi- or many-core platforms. To address this gap, we propose a new parallel programming model that inherently embodies the notion of best-effort computing, wherein the underlying parallel computing environment is not expected to be perfect. The proposed best-effort programming model leverages three key characteristics of RM applications: (1) the input data is noisy and it often contains significant redundancy, (2) computations performed on the input data are statistical in nature, and (3) some degree of imprecision in the output is acceptable. As a specific instance of the best-effort parallel programming model, we describe an ldquoiterative-convergencerdquo parallel template, which is used by a significant class of RM applications. We show how best-effort computing can be used to not only reduce computational workload, but to also eliminate dependencies between computations and further increase parallelism. Our experiments on an 8-core machine demonstrate a speed-up of 3.5X and 4.3X for the K-means and GLVQ algorithms, respectively, over a conventional parallel implementation. We also show that there is almost no material impact on the accuracy of results obtained from best-effort implementations in the application context of image segmentation using K-means and eye detection in images using GLVQ.

关键词： Concurrent computing Iterative algorithms parallel processing Clustering algorithms Application software parallel programming Explosives Explosions Internet Convergence

来源：评论

学校读者我要写书评

暂无评论

Predictive analysis and optimisation of pipelined wavefront computations

Predictive analysis and optimisation of pipelined wavefront ...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： G.R. Mudalige S.D. Hammond J.A. Smith S.A. Jarvis High Performance Systems Group University of Warwick Coventry UK

Pipelined wavefront computations are a ubiquitous class of parallel algorithm used for the solution of a number of scientific and engineering applications. This paper investigates three optimisations to the generic pipelined wavefront algorithm, which are investigated through the use of predictive analytic models. The modelling of potential optimisations is supported by a recently developed reusable LogGP-based analytic performance model, which allows the speculative evaluation of each optimisation within the context of an industry-strength pipelined wavefront benchmark developed and maintained by the United Kingdom Atomic Weapons Establishment (AWE). The paper details the quantitative and qualitative benefits of: (1) parallelising computation blocks of the wavefront algorithm using OpenMP; (2) a novel restructuring/shifting of computation within the wavefront code and, (3) performing simultaneous multiple sweeps through the data grid.

关键词： Concurrent computing Pervasive computing Context modeling Grid computing parallel algorithms Algorithm design and analysis Predictive models Performance analysis Defense industry Weapons

来源：评论

学校读者我要写书评

暂无评论

Using hardware transactional memory for data race detection

Using hardware transactional memory for data race detection

引用

international symposium on parallel and distributed processing (IPDPS)

作者： Shantanu Gupta Florin Sultan Srihari Cadambi Franjo Ivancic Martin Rotteler Department of EE and CS University of Michigan USA NEC Laboratories of America Inc. Princeton NJ USA

ISBN: (纸本)9781424437511

Widespread emergence of multicore processors will spur development of parallel applications, exposing programmers to degrees of hardware concurrency hitherto unavailable. Dependable multithreaded software will have to rely on the ability to dynamically detect non-deterministic and notoriously hard to reproduce synchronization bugs manifested through data races. Previous solutions to dynamic data race detection have required specialized hardware, at additional power, design and area costs. We propose RaceTM, a novel approach to data race detection that exploits hardware that will likely be present in future multiprocessors, albeit for a different purpose. In particular, we show how emerging hardware support for transactional memory can be leveraged to aid data race detection. We propose the concept of lightweight debug transactions that exploit the conflict detection mechanisms of transactional memory systems to perform data race detection. We present a proof-of-concept simulation prototype, and evaluate it on data races injected into applications from the SPLASH-2 suite. Our experiments show that this technique is effective at discovering data races and has low performance overhead.

关键词： Hardware parallel programming Yarn Multicore processing Costs National electric code Laboratories Programming profession Concurrent computing Synchronization

来源：评论

学校读者我要写书评

暂无评论

Security System for Overlapping Non-dedicated Clusters

Security System for Overlapping Non-dedicated Clusters

引用

international symposium on parallel and distributed processing with applications, ISPA

作者： Martin Stava Pavel Tvrdik Department of Computer Science and Engineering Czech Technical University Prague Czech Republic

Techniques for building local area network clusters differ from those used for large scale harvesting of idle computing power. The overlapping non dedicated clusters (OndC) architecture is trying to mix advantages of both techniques. Clusters build in OndC style can be deployed both on small scale local networks, but as well in large scale over the Internet deployments. In this paper we analyze the security requirements of OndC and describe our solution. The solution was implemented for the Clondike clustering system, but the same approach can be used for any other OndC system. The proposed system is inspired by the security mechanisms of existing P2P grid systems and various trust management systems, but it is tailored to exactly match the OndC requirements. An important aspect of the proposed solution is a combination of locally issued identity based access control and certificates based delegated authorizations. While the identity based access control is the most intuitive way how to express trust for the users of the system, delegated authorizations are an answer for more complex cases. The unique feature of the proposed system is configurable mechanism for authorization distributions and storage that enables users to trade-off a local information availability with local storage requirements.

关键词： Computer networks Large-scale systems Authorization Power system security Buildings Local area networks IP networks Access control distributed processing Application software

来源：评论

学校读者我要写书评

暂无评论

Network awareness of P2P live streaming applications

Network awareness of P2P live streaming applications

引用

international symposium on parallel and distributed processing (IPDPS)

作者： Delia Ciullo Maria Antonieta Garcia Akos Horvath Emilio Leonardi Marco Mellia Dario Rossi Miklos Telek Paolo Veglia Politecnico di Torino Italy Budapest University슠of슠Technology슠and슠Economics Hungary Telecom ParisTech France

Early P2P-TV systems have already attracted millions of users, and many new commercial solutions are entering this market. Little information is however available about how these systems work. In this paper we present large scale sets of experiments to compare three of the most successful P2P-TV systems, namely PPLive, SopCast and TVAnts. Our goal is to assess what level of "network awareness" has been embedded in the applications, i.e., what parameters mainly drive the peer selection and data exchange. By using a general framework that can be extended to other systems and metrics, we show that all applications largely base their choices on the peer bandwidth, i.e., they prefer high-bandwidth users, which is rather intuitive. Moreover, TVAnts and PPLive exhibits also a preference to exchange data among peers in the same autonomous system the peer belongs to. However, no evidence about preference versus peers in the same subnet or that are closer to the considered peer emerges. We believe that next-generation P2P live streaming applications definitively need to improve the level of network-awareness, so to better localize the traffic in the network and thus increase their network-friendliness as well.

关键词： Peer to peer computing Telecommunication traffic Web and internet services Quality of service Scattering Stability Character generation Testing Large-scale systems Bandwidth

来源：评论

学校读者我要写书评

暂无评论

An Efficient Task Allocation Protocol for P2P Multi-agent Systems

An Efficient Task Allocation Protocol for P2P Multi-agent Sy...

引用

international symposium on parallel and distributed processing with applications, ISPA

作者： Dayong Ye Quan Bai Minjie Zhang Khin Than Win Zhiqi Shen School of Computer Science and Software Engineering University of Wollongong NSW Australia School of Information Systems and Technology University of Wollongong NSW Australia Division of Information Systems School of Computer Engineering College of Engineering Nanyang Technological University Singapore

Recently, task allocation in multi-agent systems has been investigated by many researchers. Some researchers suggested to have a central controller which has a global view about the environment to allocate tasks. Although centralized control brings convenience during task allocation processes, it also has some obvious weaknesses. Firstly, a central controller plays an important role in a multi-agent system, but task allocation procedures will break down if the central controller of a system cannot work properly. Secondly, centralized multi-agent architecture is not suitable for distributed working environments. In order to overcome some limitations caused by centralized control, some researchers proposed distributed task allocation protocols. They supposed that each agent has a limited local view about its direct linked neighbors, and can allocate tasks to its neighbors. However, only involving direct linked neighbors could limit resource origins, so that the task allocation efficiency will be greatly reduced. In this paper, we propose an efficient task allocation protocol for P2P multi-agent systems. This protocol allows not only neighboring agents but also indirect linked agents in the system to help with a task if needed. Through this way, agents can achieve more efficient and robust task allocations in loosely coupled distributed environments (e.g. P2P multi-agent systems). A set of experiments are presented in this paper to evaluate the efficiency and adaptability of the protocol. The experiment result shows that the protocol can work efficiently in different situations.

关键词： Protocols Multiagent systems Centralized control Control systems Resource management Information systems Robustness Communication system control distributed processing Application software

来源：评论

学校读者我要写书评

暂无评论

BonjourGrid: Orchestration of multi-instances of grid middlewares on institutional Desktop Grids

BonjourGrid: Orchestration of multi-instances of grid middle...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： Heithem Abbes Christophe Cerin Mohamed Jemni LIPN/UMR 7030-CNRS Université Paris 13 Villetaneuse France Research Unit UTIC ESSTT Université de Tunis Tunis Tunisia

While the rapidly increasing number of users and applications running on desktop grid (DG) systems does demonstrate its inherent potential, current DG implementations follow the traditional master-worker paradigm and DG middlewares do not cooperate. To extend the DG architecture, we propose a novel system, called BonjourGrid, capable of 1) creating, for each user, a specific execution environment in a decentralized fashion and 2) contrarily to classical DG, of orchestrating multiple and various instances of desktop grid middlewares. This will enable us to construct, on demand, specific execution environments (combinations of Xtrem Web, Condor, Boinc middlewares). BonjourGrid is a software which aims to link a discovery service based on publish/subscribe protocol with the upper layer of a desktop grid middleware bridging the gap to meta-grid. Our experimental evaluation proves that BonjourGrid is robust and able to orchestrate more than 400 instances of Xtrem Web middleware in a concurrent fashion on a 1000 host cluster. This experiment demonstrates the concept of BonjourGrid as well as its potential and shows that, comparing to a classical desktop grid with one central master, BonjourGrid suffers from an acceptable overhead that can be explained.

关键词： Middleware Protocols Grid computing Robustness Resource management Potential well Collaboration Collaborative work Extraterrestrial measurements Computer applications

来源：评论

学校读者我要写书评

暂无评论

The effect of heavy-tailed distribution on the performance of non-contiguous allocation strategies in 2D mesh connected multicomputers

The effect of heavy-tailed distribution on the performance o...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： Saad Bani Mohammad Department of Computer Science. Prince Hussein Bin Abdullah College for Information Technology Al al-Bayt University Mafraq Jordan

The performance of non-contiguous allocation strategies has been evaluated under the assumption that the number of messages sent by jobs, which is one of the factors that the job execution times depend on, follow an exponential distribution. However, many measurement studies have convincingly demonstrated that the execution times of certain computational applications are best characterized by heave-tailed, job execution times. In this paper, the performance of existing non-contiguous allocation strategies is revisited in the context of heavy-tailed distributions. The strategies are evaluated and compared using simulation experiments for both First-Come-First-Served (FCFS) and Shortest-Service-Demand (SSD) scheduling under a variety of system loads and system sizes. The results show that the performance of the non-contiguous allocation strategies degrades considerably when the number of messages sent follow a heavy-tailed distribution against that of the exponential distribution. Moreover, SSD copes much better than FCFS scheduling in the presence of heavy-tailed job execution times.

关键词： Processor scheduling Exponential distribution Degradation Computer science Educational institutions Information technology parallel machines Mesh networks Multiprocessor interconnection networks Mesh generation

来源：评论

学校读者我要写书评

暂无评论

A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets

A faster parallel algorithm and efficient multithreaded impl...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： Kamesh Madduri David Ediger Karl Jiang David A. Bader Daniel Chavarria-Miranda Computational Research Division Lawrence Berkeley National Laboratory Berkeley CA USA College of Computing Georgia Institute of Technology Atlanta GA USA High Performance Computing Pacific Northwest National Laboratory Richland WA USA

We present a new lock-free parallel algorithm for computing betweenness centrality of massive complex networks that achieves better spatial locality compared with previous approaches. Betweenness centrality is a key kernel in analyzing the importance of vertices (or edges) in applications ranging from social networks, to power grids, to the influence of jazz musicians, and is also incorporated into the DARPA HPCS SSCA#2, a benchmark extensively used to evaluate the performance of emerging high-performance computing architectures for graph analytics. We design an optimized implementation of betweenness centrality for the massively multithreaded Cray XMT system with the Thread-storm processor. For a small-world network of 268 million vertices and 2.147 billion edges, the 16-processor XMT system achieves a TEPS rate (an algorithmic performance count for the number of edges traversed per second) of 160 million per second, which corresponds to more than a 2times performance improvement over the previous parallel implementation. We demonstrate the applicability of our implementation to analyze massive real-world datasets by computing approximate betweenness centrality for the large IMDb movie-actor network.

关键词： parallel algorithms Computer networks Performance analysis Concurrent computing Complex networks Kernel Social network services Power grids Grid computing High performance computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共172页 << < 89 90 91 92 93 94 95 96 97 98 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：