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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

87 篇 工学
- 77 篇 计算机科学与技术...
- 52 篇 软件工程
- 13 篇 信息与通信工程
- 10 篇 电气工程
- 10 篇 控制科学与工程
- 7 篇 电子科学与技术（可...
- 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 篇 school of comput...
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...

作者

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 篇 ningjiang chen
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

语言

181 篇 英文
2 篇 其他

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

共 183 条记录，以下是121-130 订阅

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

详细简洁

排序：

An efficient uniform run-time scheme for mixed regular-irregular applications 98

An efficient uniform run-time scheme for mixed regular-irreg...

引用

Proceedings of the 12th international conference on Supercomputing

作者： Dhruva R. Chakrabarti Nagaraj Shenoy Alok Choudhary Prithviraj Banerjee Center for Parallel and Distributed Computing ECE Dept. Tech. Institute Northwestern University 2145 Sheridan Road Evanston IL

来源：评论

学校读者我要写书评

暂无评论

A parallel circuit-partitioned algorithm for timing driven cell placement

A parallel circuit-partitioned algorithm for timing driven c...

引用

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

作者： J.A. Chandy P. Banerjee Sierra Vista Research Inc. Los Gatos CA USA Center for Parallel and Distributed Computing Northwestern University Evanston IL USA

Simulated annealing based standard cell placement for VLSI designs has long been acknowledged as a compute-intensive process. All previous work in parallel simulated annealing based placement has minimized area, but with deep submicron design, minimizing wirelength delay is also needed. The algorithm discussed in this paper is the first parallel algorithm for timing driven placement. We have used a very accurate Elmore delay model which is more complete intensive and hence the need for parallel placement is more apparent. parallel placement is also needed for very large circuits that may not fit in the memory of a single processor. Therefore, our algorithm is circuit partitioned and can handle arbitrary large circuits on distributed memory multiprocessors. The algorithm, called mpi PLACE, has been tested on several large benchmarks on a variety of parallel architectures.

关键词： Timing Computational modeling Circuit simulation Simulated annealing Delay Partitioning algorithms Very large scale integration parallel algorithms Circuit testing Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm for timing-driven global routing for standard cells

A parallel algorithm for timing-driven global routing for st...

引用

International Conference on parallel Processing (ICPP)

作者： Zhaoyun Xing P. Banerjee Sun MicroSystems Laboratories Inc. Palo Alto CA USA Center for Parallel and Distributed Computing Northwestern University Evanston IL USA

The timing-driven global routing problem is an extremely important and time consuming phase of any automated layout system. In this paper, by integrating high performance interconnection tree construction, wire-sizing, and switch-able segment channel optimization together, we propose an adaptive timing-driven global routing algorithm which minimizes the timing delay as well as circuit area. Our experiments on MCNC benchmarks show that our timing-driven global routing algorithm reduces the maximum path delays significantly from the global router TimberWolfSC. Based on this adaptive timing-driven global routing algorithm, a parallel algorithm on timing-driven global routing for standard cells is given. This algorithm has been implemented on an 8 processor IBM J-40 shared memory multi-processor by using the Message Passing Interface (MPI). Our experimental results show good speedup and circuit delay results for this parallel algorithm using MCNC benchmark circuits.

关键词： parallel algorithms Delay Routing Integrated circuit interconnections Switching circuits Timing Message passing Circuit topology Contracts Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

On design of cluster and grid computing environment toolkit for bioinformatics applications∗ 6th

引用

6th International Workshop on distributed computing, IWDC 2004

作者： Yang, Chao-Tung Kuo, Yu-Lun Li, Kuan-Ching Gaudiot, Jean-Luc High Performance Computing Laboratory Dept. of Computer Science and Information Engineering Tunghai University Taichung40744 Taiwan Parallel and Distributed Processing Center Dept. of Computer Science and Information Management Providence University Taichung43301 Taiwan Parallel and Scalable Computer Architecture Laboratory Dept. of Electrical Engineering and Computer Science University of California – Irvine IrvineCA92697 United States

ISBN: (纸本)9783540240761

In this paper, we present BioGrid, a novel computing resource that combines advantages of grid computing technology with bioinformatics parallel applications. The grid environment permits the sharing of a large amount of idle computing resources and data. The investigation of bioinformatics demands orders of magnitude of computing resources and in parallel, the biological data are growing in such a high speed. By using BioGrid, we plan to integrate and share resources and biological data using the grid computing technology. Still in this paper, the well-known FASTA application is performed as matter of testing and analysis in our grid computing platform, as goal to show the improved efficiency and reduced computation time. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Noncontiguous I/O through PVFS

Noncontiguous I/O through PVFS

引用

IEEE International Conference on Cluster computing

作者： Avery Ching A. Choudhary Wei-keng Liao R. Ross W. Gropp Center for Parallel and Distributed Computing Northwestern University Evanston IL USA Mathematics and Computer Science Division Argonne National Laboratory Argonne IL USA

With the tremendous advances in processor and memory technology, I/O has risen to become the bottleneck in high-performance computing for many applications. The development of parallel file systems has helped to ease the performance gap, but I/O still remains an area needing significant performance improvement. Research has found that noncontiguous I/O access patterns in scientific applications combined with current file system methods, to perform these accesses lead to unacceptable performance for large data sets. To enhance performance of noncontiguous I/O, we have created list I/O, a native version of noncontiguous I/O. We have used the parallel Virtual File System (PVFS) to implement our ideas. Our research and experimentation shows that list I/O outperforms current noncontiguous I/O access methods in most I/O situations and can substantially enhance the performance of real-world scientific applications.

关键词： File systems File servers Concurrent computing Linux distributed computing Application software Costs Network servers Mathematics Computer science

来源：评论

学校读者我要写书评

暂无评论

A dynamic load balancing strategy for channel assignment using selective borrowing in cellular mobile environment 96

A dynamic load balancing strategy for channel assignment usi...

引用

Proceedings of the 2nd annual international conference on Mobile computing and networking

作者： Sajal K. Das Sanjoy K. Sen Rajeev Jayaram Center for Research in Parallel and Distributed Computing Department of Computer Sciences University of North Texas P.O. Box 13886 Denton TX

来源：评论

学校读者我要写书评

暂无评论

Efficient construction of catastrophic patterns for VLSI reconfigurable arrays with bidirectional links

Efficient construction of catastrophic patterns for VLSI rec...

引用

International Conference on computing and Information (ICCI)

作者： A. Nayak L. Pagli N. Santoro Center for Parallel & Distributed Computing School of Computer Science Carleton University Ottawa Canada Dipartimento di Scienze dellInformazione University of Pisa Pisa Italy

Patterns of faults that are catastrophic for regular architectures, particularly the systolic arrays, have been studied. For a given link configuration, there are many fault patterns which are catastrophic. Among those, there is a particular fault pattern, called the reference fault pattern, which is crucial for the development of testing techniques; furthermore, the efficiency of any testing algorithm can be further improved in the presence of efficient algorithms for constructing the reference fault pattern. The authors develop a new algorithm for the construction of the reference fault pattern for VLSI reconfigurable arrays in which the links are bidirectional. The complexity of the new algorithm is O(kN) which is a significant improvement over the existing O(N/sup 2/) algorithm, where k is the number of bypass links, and N is the length of the largest bypass link.< >

关键词： Very large scale integration Redundancy Systolic arrays distributed computing Computer science Fault tolerance Clustering algorithms System testing Fault diagnosis Sufficient conditions

来源：评论

学校读者我要写书评

暂无评论

Recognition of catastrophic faults

Recognition of catastrophic faults

引用

IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems

For a given design, it is not difficult to identify a set of elements whose failure will have catastrophic consequence. There exist many patterns (random distribution) of faults, not in a block, which can be fatal for the system. Therefore, the characterization of such fault patterns is crucial for the identification, testing and detection of such catastrophic events. This paper, is concerned with the development of efficient recognition schemes; that is, efficient mechanisms which automatically determine whether or not an observed/detected pattern of faults will have catastrophic consequences. The problem of recognizing whether a fault pattern is catastrophic has been addressed.< >

关键词： Redundancy Pattern recognition Fault tolerance Fault detection Event detection Testing distributed computing Computer science Fault diagnosis Sufficient conditions

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for force directed scheduling of flattened and hierarchical signal flow graphs

Parallel algorithms for force directed scheduling of flatten...

引用

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

作者： P. Prabhakaran P. Banerjee Center for Reliable and High-Performance Computing Coordinated Science Laboratory University of Illinois Urbana IL USA Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston IL USA

In this paper we present some novel algorithms for scheduling hierarchical signal flow graphs in the domain of high-level synthesis. There are several key contributions of this paper. First, we develop a novel extension of the force directed scheduling problem which naturally handles loops and conditionals by coming up with a scheme of scheduling hierarchical signal flow graphs. Second, we develop three new parallel algorithms for the scheduling problem. Third, our parallel algorithms are portable across a wide range of parallel platforms. We report results on a set of high-level synthesis benchmarks on 8-processor SGI Challenge and a network of 4 SUN SPARCstation5 work stations. Finally, while some parallel algorithms for VLSI CAD reported by earlier researchers have reported a loss of qualities of results, our parallel algorithms produce exactly the same results as the sequential algorithms on which they are based.

关键词： parallel algorithms Flow graphs Processor scheduling Concurrent computing Scheduling algorithm Contracts Cost function Broadcasting

来源：评论

学校读者我要写书评

暂无评论

A recursive-adjustment co-allocation scheme in data grid environments 1

引用

6th International Conference on Algorithms and Architectures for parallel Processing, ICA3PP

作者： Yang, Chao-Tung Yang, I.-Hsien Li, Kuan-Ching Hsu, Ching-Hsien High Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung 40704 Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung 43301 Taiwan Department of Computer Science and Information Engineering Chung Hua University Hsinchu 300 Taiwan

ISBN: (数字)9783540320715

ISBN: (纸本)3540292357

The co-allocation architecture was developed in order to enable parallel downloads of datasets from multiple servers. Several co-allocation strategies have been coupled and used to exploit rate differences among various client-server links and to address dynamic rate fluctuations by dividing files into multiple blocks of equal sizes. However, a major obstacle, the idle time of faster servers having to wait for the slowest server to deliver the final block, makes it important to reduce differences in finish time among replica servers. In this paper, we propose a dynamic co-allocation scheme, namely Recursive-Adjustment Co-Allocation scheme, to improve the performance of data transfer in Data Grids. Our approach reduces the idle time spent waiting for the slowest server and decreases data transfer completion time. © Springer-Verlag Berlin Heidelberg 2005.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：