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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

151 篇 会议
29 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

85 篇 工学
- 77 篇 计算机科学与技术...
- 51 篇 软件工程
- 12 篇 信息与通信工程
- 9 篇 电气工程
- 9 篇 控制科学与工程
- 6 篇 电子科学与技术（可...
- 3 篇 力学（可授工学、理...
- 3 篇 机械工程
- 3 篇 材料科学与工程（可...
- 3 篇 建筑学
- 3 篇 土木工程
- 3 篇 生物工程
- 2 篇 交通运输工程
- 2 篇 环境科学与工程（可...
- 1 篇 冶金工程
- 1 篇 航空宇航科学与技...
- 1 篇 核科学与技术
- 1 篇 农业工程
35 篇 理学
- 25 篇 数学
- 5 篇 化学
- 4 篇 生物学
- 2 篇 物理学
- 2 篇 系统科学
23 篇 管理学
- 18 篇 管理科学与工程(可...
- 12 篇 工商管理
- 7 篇 图书情报与档案管...
4 篇 经济学
- 4 篇 应用经济学
4 篇 法学
- 3 篇 社会学
- 1 篇 法学
2 篇 教育学
- 2 篇 教育学
2 篇 医学
1 篇 农学
1 篇 军事学

主题

37 篇 distributed comp...
28 篇 concurrent compu...
15 篇 parallel algorit...
15 篇 computational mo...
14 篇 computer science
11 篇 parallel process...
11 篇 contracts
9 篇 partitioning alg...
8 篇 runtime
8 篇 grid computing
8 篇 resource managem...
8 篇 algorithm design...
8 篇 load management
8 篇 computer network...
7 篇 application soft...
7 篇 computer archite...
7 篇 costs
6 篇 fault tolerance
6 篇 bandwidth
6 篇 very large scale...

机构

17 篇 center for paral...
17 篇 parallel and dis...
10 篇 center for paral...
6 篇 center for paral...
5 篇 parallel and dis...
5 篇 department of co...
5 篇 parallel and dis...
5 篇 parallel and dis...
5 篇 high performance...
5 篇 guangxi intellig...
4 篇 center for resea...
4 篇 center for paral...
4 篇 high performance...
4 篇 center for paral...
4 篇 center for paral...
4 篇 parallel and dis...
3 篇 high-performance...
3 篇 college of compu...
3 篇 school of comput...
3 篇 center for paral...

作者

26 篇 p. banerjee
18 篇 li kuan-ching
18 篇 yang chao-tung
15 篇 a. choudhary
11 篇 cai wentong
9 篇 wentong cai
9 篇 a. nayak
7 篇 s.k. das
6 篇 dehne f
6 篇 das sajal k.
5 篇 kuan-ching li
5 篇 s. roy
5 篇 hsu ching-hsien
5 篇 chao-tung yang
5 篇 m. haldar
4 篇 santoro nicola
4 篇 n. santoro
4 篇 turner stephen j...
4 篇 zhou suiping
4 篇 lee liang-teh

语言

179 篇 英文
2 篇 其他

检索条件"机构=Center for Parallel and Distributed Computing"

共 181 条记录，以下是81-90 订阅

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

详细简洁

排序：

On reducing false sharing while improving locality on shared memory multiprocessors

On reducing false sharing while improving locality on shared...

引用

International Conference on parallel Architecture and Compilation Techniques (PACT)

作者： M. Kandemir A. Choudhary J. Ramaujam P. Banerjee Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston IL USA

The performance of applications on large shared-memory multiprocessors with coherent caches depends on the interaction between the granularity of data sharing, the size of the coherence unit and the spatial locality exhibited by the applications, in addition to the amount of parallelism in the applications. Large coherence units are helpful in exploiting spatial locality, but worsen the effects of false sharing. We present a mathematical framework that allows a clean description of the relationship between spatial locality and false sharing. We first show how to identify a severe form of multiple-writer false sharing and then demonstrate the importance of the interaction between optimization techniques aimed at enhancing locality and the techniques oriented toward reducing false sharing. Given the conflicting requirements, a compiler based approach to this problem holds promise. We investigate the use of data transformations in addressing spatial locality and false sharing, and derive an approach that balances the impact of the two. Experimental results demonstrate that such a balanced approach outperforms those approaches that consider only one of these two issues. On an eight-processor SGI Origin 2000 system, our approach brings an additional 9% improvement over a powerful locality optimization technique that uses both loop and data transformations. Also, our approach obtains an additional 19% improvement over an optimization technique that is oriented specifically toward reducing false sharing.

关键词： parallel machines Random access memory Cost function parallel processing Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

A low-power logic optimization methodology based on a fast power-driven mapping

A low-power logic optimization methodology based on a fast p...

引用

IEEE International Conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： S. Roy H. Arts P. Banerjee Ambit Design Systems Santa Clara USA Center for Parallel & Distributed Computing Northwestern University USA

This paper describes a novel technique of integrating a fast power-driven mapper with structural optimizations that target low power consumption. The power-driven mapping technique is based on the decomposed factored form representation of Boolean expressions. The power cost function based on this mapped netlist is more accurate than the previous cost functions. It is used to guide the structural transformations in our low-power driven logic synthesis tool. Circuits synthesized by the area optimization tool, SIS, consume on an average 54.5% more power and require 21.9% more area than those obtained by our tool. Finally, results obtained from the power optimization tool, POSE, are on the average 10.4% and 5.6% inferior in power consumption and area respectively to those obtained by our tool.

关键词： Optimization methods Energy consumption Space technology Design optimization Circuit synthesis Logic circuits Contracts Cost function Clustering algorithms Iterative algorithms

来源：评论

学校读者我要写书评

暂无评论

Interprocedural array redistribution data-flow analysis 9th

引用

9th International Workshop on Languages and Compilers for parallel computing, LCPC 1996

作者： Palermo, Daniel J. Hodges Iv, Eugene W. Banerjee, Prithviraj Hewlett-Packard Company Convex Division RichardsonTX75083 United States SAS Institute Inc CaryNC27513 United States Northwestern University Center for Parallel and Distributed Computing EvanstonIL60208 United States

ISBN: (纸本)3540630910

In High Performance Fortran (HPF), array redistribution can be described explicitly using directives (REDISTRIBUTE or REALIGN) which specify where new distributions become active or implicitly by calling functions which require different data distributions than the calling function. In order to actually compile an HPF program into an efficient form, however, both the redistribution operations as well as the possible distributions for the individual blocks of code must be known at compile-time. In this paper, we present an interprocedural dataflow framework which takes into account both explicit and implicit redistribution to automatically: (1) determine which distributions hold over specific sections of a program, (2) optimize both the inter- and intraprocedural transitions between dynamic distributions while still maintaining the original semantics of the HPF program, (3) determine when the distribution pattern specified by an HPF program causes a given array to be assigned multiple distributions due to different redistribution operations on multiple paths within a function or as a result of parameter aliasing (resulting in a non-conforming HPF program), as well as (4) convert (well behaved) dynamic HPF programs into equivalent static forms through a process we refer to as static distribution assignment (SDA) which can be used to extend the capabilities of existing subset HPF compilers that support static data distributions. As the approach presented in this paper has already been implemented as part of the PARADIGM (parallelizing compiler for distributed-memory General-purpose Multicomputers) project at the University of Illinois, examples will also be presented to demonstrate several applications of this framework. © Springer-Verlag Berlin Heidelberg 1997.

关键词： Data flow analysis

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for power estimation

Parallel algorithms for power estimation

引用

Design Automation Conference

作者： V. Kim P. Banerjee Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston IL USA

Several techniques currently exist for estimating the power dissipation of combinational and sequential circuits using exhaustive simulation, Monte Carlo sampling, and probabilistic estimation. Exhaustive simulation and Monte Carlo sampling techniques can be highly reliable but often require long runtimes. This paper presents a comprehensive study of pattern-partitioning and circuit-partitioning parallelization schemes for those two methodologies in the context of distributed-memory multiprocessing systems. Issues in pipelined event-driven simulation and dynamic load balancing are addressed. Experimental results are presented for an IBM SP-2 system and a network of HP-9000 workstations. For instance, runtimes have been reduced from over 3 hours to under 20 minutes in one case.

关键词： parallel algorithms Circuit simulation Monte Carlo methods Runtime Power dissipation Sequential circuits Power system reliability Multiprocessing systems Discrete event simulation Load management

来源：评论

学校读者我要写书评

暂无评论

Dynamic load balancing strategies for conservative parallel simulations 97

Dynamic load balancing strategies for conservative parallel ...

引用

Proceedings of the eleventh workshop on parallel and distributed simulation

作者： Azzedine Boukerche Sajal K. Das Center for Research in Parallel and Distributed Computing Department of Computer Sciences University of North of Texas Denton TX

ISBN: (纸本)9780818679650

This paper studies the problem of load balancing for conservative parallel simulations for execution on a multicomputer. The synchronization protocol makes use of Chandy-Misra null-messages. We propose a dynamic load balancing algorithm which assumes no compile time knowledge about the workload parameters. It is based upon a process migration mechanism, and the notion of CPU-queue length, which indicates the workload at each *** examine two variations for the algorithm which we refer to as centralized and multi-level hierarchical methods, in the context of queueing network simulation of a torus. The torus was chosen because it of its many cycles aid in the formation of deadlock making it a stress test for any conservative synchronization protocols. Our experiments indicate that our dynamic load balancing schemes significantly reduce the run time of an optimized version of Chandy-Misra null message approach, and decreases by 30-40\% the synchronization overhead when compared to the use of a static partitioning algorithm. Significantly, the results obtained also indicate that the multi-level scheme always outperforms both the centralized load balancing approach and the static partitioning algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MS-I/O: A distributed Multi-Storage I/O System 02

MS-I/O: A Distributed Multi-Storage I/O System

引用

IEEE/ACM International Symposium on Cluster computing and the Grid (CCGRID)

作者： Xiaohui Shen A. Choudhary Department of Electrical and Computer Engineering Center for Parallel and Distributed Computing Northwestern University Evanston IL USA

ISBN: (纸本)9780769515823

More and more parallel applications are running in a distributed environment to take advantage of easily available and inexpensive commodity resources. For data intensive applications, employing multiple distributed storage resources has many advantages. In this paper, we present a Multi-Storage I/O System (MS-I/O) that can not only effectively manage various distributed storage resources in the system, but also provide novel high performance storage access schemes. MS-I/O employs many state-of-the-art I/O optimizations such as collective I/O, asynchronous I/O etc. and a number of new techniques such as data location, data replication, subfile, superfile and data access history. In addition, many MS-I/O optimization schemes can work simultaneously within a single data access session, greatly improving the performance. Although I/O optimization techniques can help improve performance, it also complicates I/O system. In addition, most optimization techniques have their limitations. Therefore, selecting accurate optimization policies requires ex-pert knowledge which is not suitable for end users who may have little knowledge of I/O techniques. So the task of I/O optimization decision should be left to the I/O system itself, that is, automatic from user's point of view. We present a User Access Pattern data structure which is associated With each dataset that can help MS-I/O easily make accurate I/O optimization decisions.

关键词： distributed computing Application software Resource management Prefetching History Data structures Communications technology parallel processing Computer networks Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Decision tree construction for data mining on grid computing environments

Decision tree construction for data mining on grid computing...

引用

19th International Conference on Advanced Information Networking and Applications, AINA 2005

作者： Yang, Chao-Tung Tsai, Shu-Tzu Li, Kuan-Ching High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung City 40704 Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung County 43301 Taiwan

ISBN: (纸本)0769522491

In this paper, we present our Grid-based decision tree architecture, with the intention of applying it to both parallel and sequential algorithms. Also, we show that, based on the scope and model of data mining applied in the Grid environment as well as user equivalent perspective, Grid roles can be categorized into three types. It is our goal, through these definitions, to help software developers define clear system processes and differentiate the application scope for software applications. To, fulfill our architecture, we first apply an existing parallel decision tree algorithm (the SPRINT algorithm) to the Grid environment. The performance and differences in many other areas are compared using datasets of different sizes. The experimental results will be used for future reference and further development. © 2005 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

A structured channel borrowing scheme for dynamic load balancing in cellular networks

A structured channel borrowing scheme for dynamic load balan...

引用

International Conference on distributed computing Systems

作者： S.K. Das S.K. Sen R. Jayaram Center for Research in Parallel and Distributed Computing Department of Computer Sciences University of North Texas Denton TX USA

We propose an efficient dynamic load balancing scheme in cellular networks for managing a teletraffic hot spot in which channel demand exceeds a certain threshold. A hot spot, depicted as a stack of hexagonal 'ring' of cells, is classified as complete if all cells within it are hot. The rings containing only cold cells outside the hot spot are called 'peripheral rings'. Our load balancing scheme migrates channels through a structured borrowing mechanism from the cold cells within the 'rings' or 'peripheral rings' to the hot cells in the hot spot. For the more general case of an incomplete hot spot, a cold cell is further classified as cold safe, cold semi-safe or cold unsafe, and a demand graph is constructed from the channel demand of each hot cell from its adjacent cells in the next outer ring. The channel borrowing algorithm works on the demand graph in a bottom up fashion, satisfying the demands of the cells in each subsequent inner ring. Markov chain models are developed for a hot cell and detailed simulation experiments are conducted to evaluate the performance of our load balancing scheme. Comparison with an existing load balancing strategy under moderate and heavy teletraffic conditions, shows a performance improvement of 12% in terms of call blockade by our load balancing scheme.

关键词： Load management Intelligent networks Land mobile radio cellular systems Frequency distributed computing Base stations Computer networks Concurrent computing Electronic mail Computer network management

来源：评论

学校读者我要写书评

暂无评论

An enhanced parallel loop self-scheduling scheme for cluster environments

An enhanced parallel loop self-scheduling scheme for cluster...

引用

19th International Conference on Advanced Information Networking and Applications, AINA 2005

作者： Yang, Chao-Tung Cheng, Kuan-Wei Li, Kuan-Ching High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung City 40704 Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung County 43301 Taiwan

ISBN: (纸本)0769522491

In this paper, a parallel loop self-scheduling scheme for heterogeneous PC cluster systems is proposed. Though the proposed scheme does allow users to choose parameters before the execution initialization phase, there are still weaknesses that motivate us to go further with new improvements in that scheme. For instance, a decision on a fixed and monotonous parameter can easily lead to invalid schedule by using previous input information. Thus, it is proposed in this paper a new scheme, where the scheduling parameter can be adjusted dynamically and fit into most widely available computer systems, in order to provide higher overall performance. © 2005 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

A high-performance computational resource broker for Grid computing environments

A high-performance computational resource broker for Grid Co...

引用

19th International Conference on Advanced Information Networking and Applications, AINA 2005

作者： Yang, Chao-Tung Shih, Po-Chi Li, Kuan-Ching High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung City 40704 Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung County 43301 Taiwan

ISBN: (纸本)0769522491

Internet computing and grid technologies promise to change the way we tackle complex problems. They will enable large-scale aggregation and sharing of computational, data and other resources across institutional boundaries. As Grid computing is becoming a reality, there is a need for managing and monitoring the available resources worldwide, ax well as the need for conveying these resources to the everyday user. This paper describes a resource broker with its main function as to match the available resources to the user's needs. The use of the resource broker provides a uniform interface to access any of the available and appropriate resources using user's credentials. The resource broker runs on top of the Globus Toolkit. Therefore, it provides security and current information about the available resources and serves as a link to the diverse systems available in the Grid. © 2005 IEEE.

关键词： Computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共19页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：