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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
109 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

2,426 篇 工学
- 2,336 篇 计算机科学与技术...
- 1,551 篇 软件工程
- 465 篇 信息与通信工程
- 336 篇 电气工程
- 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,503 篇 英文
45 篇 其他
1 篇 中文

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

共 3549 条记录，以下是1301-1310 订阅

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

详细简洁

排序：

Configuration steering for a reconfigurable superscalar processor

Configuration steering for a reconfigurable superscalar proc...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Veale, Brian F. Antonio, John K. Tull, Monte P. School of Computer Science University of Oklahoma School of Electrical and Computer Engineering University of Oklahoma

ISBN: (纸本)0769523129

An architecture for a reconfigurable superscalar processor is described in which some of its execution units are implemented in reconfigurable hardware. The overall configuration of the processor is defined according to how its reconfigurable execution units are configured. An efficient micro-architectural solution to configuration management is presented that effectively steers the current processor configuration toward a configuration that is well matched with the execution unit requirements of instructions being scheduled for execution. The approach first selects the best matched among four steering configurations based on the number and type of execution units required by the instructions. One of the steering configurations is dynamically defined as the current configuration;the other three are statically predefined. Once a steering configuration is selected, portions of it begin loading on corresponding reconfigurable execution units that are not busy. The active configuration of the processor is generally the overlap of two or more steering configurations.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

FPGA implementations of the massively parallel GCA model

FPGA implementations of the massively parallel GCA model

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Heenes, Wolfgang Hoffmann, Rolf Kanthak, Sebastian Darmstadt University of Technology Computer Architecture Group Hochschulstrasse 10 D-64289 Darmstadt

ISBN: (纸本)0769523129

The GCA (Global Cellular Automata) model is a very interesting and flexible model which can be used to implement all kind of parallel algorithms. The GCA model consists of a field of cells similar the Cellular Automata model. Each cell has links to a set of remote cells which can be dynamically changed from generation to generation. A cell reads the remote neighbors' states and then changes its own state according to a local rule. The model is massively parallel because all cells can change their states independently and in parallel. We have investigated how the GCA model can be implemented efficiently in hardware using a Field Programmable Gate Array (FPGA) prototyping platform. We have implemented a fully parallel architecture where all cells operate fully in parallel and other architectures where the cells are stored in memories in order to handle a large number of cells. We are showing that in the fully parallel architecture a speed-up of around 190 is realistic on a modern FPGA platform compared to a software implementation on a PC. In the partially parallel architecture based on memories the speed-up will be lower but the number of cells is only restricted by the capacity of the memories.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Modeling and taming parallel TCP on the wide area network

Modeling and taming parallel TCP on the wide area network

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Lu, Dong Qiao, Yi Dinda, Peter A. Bustamante, Fabián E. Department of Computer Science Northwestern University

ISBN: (纸本)0769523129

parallel TCP flows are broadly used in the high performance distributed computing community to enhance network throughput, particularly for large data transfers. Previous research has studied the mechanism by which parallel TCP improves aggregate throughput, but there doesn't exist any practical mechanism to predict its throughput and its impact on the background traffic. In this work, we address how to predict parallel TCP throughput as a function of the number of flows, as well as how to predict the corresponding impact on cross traffic. To the best of our knowledge, we are the first to answer the following question on behalf of a user: what number of parallel flows will give the highest throughput with less than a p% impact on cross traffic? We term this the maximum nondisruptive throughput. We begin by studying the behavior of parallel TCP in simulation to help derive a model for predicting parallel TCP through-put and its impact on cross traffic. Combining this model with some previous findings we derive a simple, yet effective, online advisor. We evaluate our advisor through extensive simulations and wide-area experimentation.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

Optimized dynamic grid-based DDM protocol for large-scale distributed simulation systems

Optimized dynamic grid-based DDM protocol for large-scale di...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Boukerche, Azzedine Lu, Kaiyuan PARADISE Research Laboratory SITE University of Ottawa Canada

ISBN: (纸本)0769523129

Data Distribution Management (DDM) is one of the six services provided by HLA/RTI as complementarities of Declaration/Interests Management to provide a flexible and extensive mechanism for further throttling the data placed on the network and delivered to federates based on simulated entities' interests of data. DDM is of essential importance especially for large scale distributed simulations. In the past a few years, two main types of DDM protocols have been developed, named region-based methods and grid-based methods. However, all of these techniques have their obvious drawbacks, which affect their deployment in most applications that require high performance and low overhead. In our previous work, we have proposed a dynamic grid-based DDM scheme that shows a great potential when compared to both region-based and grid-based approaches. In this paper, we wish to improve our previous scheme, which we refer to as optimized dynamic grid-based DDM, to further reduce irrelevant data that might be received by simulated entites.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A load balancing method for a parallel application based on a domain decomposition

A load balancing method for a parallel application based on ...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Denis, Christophe Boufflet, Jean-Paul Breitkopf, Piotr University of Paris 6 Laboratory LIP6 4 place Jussieu 75005 Paris France University of Compiegne Laboratory Heudiasyc Centre de Royallieu 60200 Compiegne France University of Compiegne Laboratory Roberval Centre de Royallieu 60200 Compiegne France

ISBN: (纸本)0769523129

The parallel multiple front method is used in mechanical engineering to solve large sparse linear systems issued from finite element modeling. It is a parallel direct method based on a nonoverlapping domain decomposition method. The decomposition is usually built with a graph partitioning approach. However this approach is not well suited to all parallel applications. It provides computing times over the subdomains which can vary from simple to double for our parallel multiple method. We show that its computing time can be decreased by load balancing the computational volume over the subdomains. We present in this communication a sequential and a parallel version of our load balancing method which corrects in computational volume an initial decomposition issued from graph partitioning tools.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Job allocation schemes in computational grids based on cost optimization

Job allocation schemes in computational grids based on cost ...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Penmatsa, Satish Chronopoulos, Anthony T. University of Texas at San Antonio Dept. of Computer Science 6900 N Loop 1604 W San Antonio TX 78249 United States

ISBN: (纸本)0769523129

In this paper we propose two price-based job allocation schemes for computational grids. A grid system tries to solve problems submitted by various grid users by allocating the jobs to the computing resources governed by different resource owners. The prices charged by these owners are obtained based on a pricing model using a bargaining game theory framework. These prices are then used for job allocation. We present the grid system model and formulate the two schemes as a constraint minimization problem and as a non-cooperative game respectively. The objective of these schemes is to minimize the cost for the grid users. We present algorithms to compute the optimal load (job) fractions to allocate jobs to the computers. Finally, the two schemes are compared under simulations with various system loads and configurations and conclusions are drawn.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Communication benchmarking and performance modelling of MPI programs on cluster computers

Communication benchmarking and performance modelling of MPI ...

引用

3rd International Workshop on Performance Modelling, Evaluation, and Optimization of parallel and distributed Systems held in Conjunction with the 18th International parallel and distributed processing symposium

作者： Grove, DA Coddington, PD Univ Adelaide Sch Comp Sci Adelaide SA 5005 Australia

ISBN: (纸本)0769521320

This paper gives an overview of two related tools that we have developed to provide more accurate measurement and modelling of the performance of message-passing communication and application programs on distributed memory parallel computers. MPIBench uses a very precise, globally synchronised clock to measure the performance of MPI communication routines. It can generate probability distributions of communication times, not just the average values produced by other MPI benchmarks. This allows useful insights to be made into the MPI communication performance of parallel computers, and in particular how performance is affected by network contention. The Performance Evaluating Virtual parallel Machine (PEVPM) provides a simple, fast and accurate technique for modelling and predicting the performance of message-passing parallel programs. It uses a virtual parallel machine to simulate the execution of the parallel program. The effects of network contention can be accurately modelled by sampling from the probability distributions generated by MPIBench. These tools are particularly useful on clusters with commodity Ethernet networks, where relatively high latencies, network congestion and TCP problems can significantly affect communication performance, which is difficult to model accurately using other tools. Experiments with example parallel programs demonstrate that PEVPM gives accurate performance predictions on commodity clusters. We also show that modelling communication performance using average times rather than sampling from probability distributions can give misleading results, particularly for programs running on a large number of processors.

关键词： parallel computing cluster computing performance modelling

来源：评论

学校读者我要写书评

暂无评论

Power and energy profiling of scientific applications on distributed systems

Power and energy profiling of scientific applications on dis...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Feng, Xizhou Ge, Rong Cameron, Kirk W. Scalable Performance Laboratory Department of Computer Science and Engineering University of South Carolina Columbia SC 29208

ISBN: (纸本)0769523129

Power consumption is a troublesome design constraint for emergent systems such as IBM's BlueGene /L. If current trends continue, future petaflop systems will require 100 megawatts of power to maintain high-performance. To address this problem the power and energy characteristics of high-performance systems must be characterized. To date, power-performance profiles for distributed systems have been limited to interactive commercial workloads. However, scientific workloads are typically non-interactive (batched) processes riddled with interprocess dependences and communication. We present a framework for direct, automatic profiling of power consumption for non-interactive, parallel scientific applications on high-performance distributed systems. Though our approach is general, we use our framework to study the power-performance efficiency of the NAS parallel benchmarks on a 32-node Beowulf cluster. We provide profiles by component (CPU, memory, disk, and NIC), by node (for each of 32 nodes), and by system scale (2, 4, 8, 16, and 32 nodes). Our results indicate power profiles are often regular corresponding to application characteristics and for fixed problem size increasing the number of nodes always increases energy consumption but does not always improve performance. This finding suggests smart schedulers could be used to optimize for energy while maintaining performance.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Effective and efficient communication in Grid computing with an extension of ProActive groups

Effective and efficient communication in Grid computing with...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Baduel, Laurent Baude, Francoise Ranaldo, Nadia Zimeo, Eugenio OASIS INRIA University of Nice Sophia Antipolis France RCOST Department of Engineering University of Sannio Benevento Italy

ISBN: (纸本)0769523129

Grid applications typically deal with huge amount of data and often the same data have to be transferred and processed on many resources. Nevertheless, the majority of existing middleware platforms for Grid computing do not provide suitable programming and communication models to make easy software development and to improve communication performances when a large set of receivers is involved. Some middlewares for wide area network computing, such as ProActive, provide the group abstraction to transparently deal with a number of similar receivers. We propose an extension of such a mechanism in order to improve its features for Grid environments. In particular, ProActive native groups have been extended both at programming and communication levels in order to support both different internal behaviors and high performance communication based on IP multicast. A case study shows the effectiveness of the new mechanism and its efficiency compared with the original one.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Automatic task scheduling / loop unrolling using dedicated RTR controllers in coarse grain reconfigurable architectures

Automatic task scheduling / loop unrolling using dedicated R...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Benoit, Pascal Torres, Lionel Sassatelli, Gilles Robert, Michel Cambon, Gaston LIRMM 161 rue Ada 34000 Montpellier

ISBN: (纸本)0769523129

When designing a SoC, matching the required performance both in terms of processing power and power consumption tends to become more and more challenging. Moreover, since the range of targeted applications for every single product is growing rapidly, employing reconfigurable accelerators makes more and more sense to this purpose. Coarse grain reconfigurable architectures bring an alternative providing interesting performance /flexibility trade-offs over traditional approaches. This paper presents an original method allowing to efficiently exploit dynamical parallelism at both loop-level and task-level, which remains rarely used. This method called DHM (Dynamic Hardware Multiplexing) is based upon the use of a hardwired controller dedicated to run-time task scheduling and automatic loop unrolling. This paper shows that significant performance improvements can be achieved through combining both intra and inter-task parallelism. Principles and validations are exposed through a case study on a coarse grain reconfigurable architecture.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共355页 << < 127 128 129 130 131 132 133 134 135 136 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：