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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

82 篇 会议
48 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

74 篇 工学
- 67 篇 计算机科学与技术...
- 46 篇 软件工程
- 14 篇 信息与通信工程
- 11 篇 控制科学与工程
- 10 篇 电气工程
- 6 篇 动力工程及工程热...
- 6 篇 生物工程
- 4 篇 环境科学与工程（可...
- 3 篇 力学（可授工学、理...
- 3 篇 机械工程
- 3 篇 电子科学与技术（可...
- 3 篇 交通运输工程
- 3 篇 生物医学工程（可授...
- 3 篇 网络空间安全
38 篇 理学
- 26 篇 数学
- 7 篇 物理学
- 6 篇 化学
- 6 篇 生物学
- 5 篇 系统科学
- 5 篇 统计学（可授理学、...
18 篇 管理学
- 13 篇 管理科学与工程(可...
- 9 篇 工商管理
- 6 篇 图书情报与档案管...
5 篇 法学
- 3 篇 社会学
- 2 篇 法学
4 篇 医学
- 3 篇 基础医学(可授医学...
- 3 篇 临床医学
- 3 篇 公共卫生与预防医...
3 篇 经济学
- 3 篇 应用经济学
3 篇 教育学
- 3 篇 教育学
2 篇 农学
1 篇 艺术学

主题

18 篇 distributed comp...
13 篇 concurrent compu...
9 篇 computer science
9 篇 parallel algorit...
8 篇 machine learning
7 篇 computer network...
5 篇 grid computing
5 篇 quality of servi...
4 篇 deep learning
4 篇 throughput
4 篇 algorithm design...
4 篇 cloud computing
3 篇 runtime
3 篇 parallel process...
3 篇 scheduling algor...
3 篇 phase change ran...
3 篇 resource managem...
3 篇 interference
3 篇 data mining
3 篇 pattern recognit...

机构

8 篇 school of comput...
7 篇 school of cyber ...
5 篇 parallel and dis...
5 篇 department of co...
5 篇 parallel and dis...
5 篇 intelligent dist...
4 篇 center for paral...
4 篇 center for resea...
4 篇 high performance...
4 篇 mitsubishi elect...
4 篇 beijing computat...
4 篇 national researc...
4 篇 national water a...
3 篇 center for appli...
3 篇 machine intellig...
3 篇 high-performance...
3 篇 laboratory schoo...
3 篇 school of electr...
3 篇 raygun performan...
3 篇 faculty of compu...

作者

9 篇 li kuan-ching
9 篇 yang chao-tung
8 篇 ismail leila
7 篇 materwala huned
7 篇 jin hai
7 篇 leila ismail
6 篇 s.k. das
6 篇 das sajal k.
5 篇 kuan-ching li
5 篇 hsu ching-hsien
5 篇 chao-tung yang
4 篇 rajkumar buyya
4 篇 zou deqing
4 篇 hai jin
3 篇 zhang zhimin
3 篇 parlikad ajith k...
3 篇 p. banerjee
3 篇 li zhen
3 篇 arora priyansh
3 篇 dustdar schahram

语言

111 篇 英文
20 篇 其他

检索条件"机构=Center for Research in Parallel and Distributed Computing Department of Computer Science"

共 131 条记录，以下是101-110 订阅

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

详细简洁

排序：

Data management for large-scale scientific computations in high performance distributed systems

Data management for large-scale scientific computations in h...

引用

International Symposium on High Performance distributed computing

作者： A. Choudhary M. Kandemir H. Nagesh J. No X. Shen V. Taylor S. More R. Thakur Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston IL USA Mathematics and Computer Science Division Argonne National Laboratory Argonne IL USA

With the increasing number of scientific applications manipulating huge amounts of data, effective data management is an increasingly important problem. Unfortunately, so far the solutions to this data management problem either require deep understanding of specific storage architectures and file layouts (as in high-performance file systems) or produce unsatisfactory I/O performance in exchange for ease-of-use and portability (as in relational DBMSs). In this paper we present a new environment which is built around an active meta-data management system (MDMS). The key components of our three-tiered architecture are user application, the MDMS, and a hierarchical storage system (HSS). Our environment overcomes the performance problems of pure database-oriented solutions, while maintaining their advantages in terms of ease-of-use and portability. The high levels of performance are achieved by the MDMS, with the aid of user-specified directives. Our environment supports a simple, easy-to-use yet powerful user interface, leaving the task of choosing appropriate I/O techniques to the MDMS. We discuss the importance of an active MDMS and show how the three components, namely application, the MDMS, and the HSS, fit together. We also report performance numbers from our initial implementation and illustrate that significant improvements are made possible without undue programming effort.

关键词： Large-scale systems distributed computing High performance computing Data visualization Engineering management Concurrent computing Relational databases Art Data analysis Image analysis

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for simultaneous scheduling, binding and floorplanning in high-level synthesis

Parallel algorithms for simultaneous scheduling, binding and...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

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

With small device features in submicron technologies, interconnection delays play a dominant part in cycle time. Hence, it is important to consider the impact of physical design during high level synthesis. In comparison to a traditional approach which separates high-level synthesis from physical design, an algorithm which is able to make these stages interact very closely, would result in solutions with lower latency and area. However, such an approach could result in increased runtimes. parallel processing is an attractive way of reducing the runtimes. In this paper, two parallel algorithms for simultaneous scheduling, binding and floorplanning algorithm are presented. A detailed hardware model is considered, taking into account multiplexor and register areas and delays. Experimental results are reported on an IBM SP-2 multicomputer, with close to linear speedups for a set of benchmark circuits.

关键词： parallel algorithms High level synthesis Runtime Integrated circuit interconnections Delay effects Algorithm design and analysis parallel processing Scheduling algorithm Hardware Registers

来源：评论

学校读者我要写书评

暂无评论

WADE: a Web-based automated parallel CAD environment

WADE: a Web-based automated parallel CAD environment

引用

International Conference on High Performance computing

作者： D.R. Chakrabarti P.G. Joisha J.A. Chandy D. Krishnaswamy V. Krishnaswamy P. Banerjee Center for Parallel and Distributed Computing Electrical and Computer Engineering Department Northwestern University Evanston IL USA Sierra Vista Research Inc. Los Gatos CA USA Intel Corporation Folsom CA USA Intel Corporation OR USA

We present a novel framework of a Web-based automated parallel CAD environment. The goal of this project is to make available to the CAD community a growing number of design and test applications that support standard interfaces and execute efficiently in a parallel environment. The design files of a user working on a remote machine are transparently shipped to the local Compute center, the relevant computation is performed in a parallel environment and then the results are returned back to the user. A job submission and scheduling tool ensures proper load balance and maximal usage of the various parallel machines. The whole process is done efficiently and transparently without the user having to bother about any low-level details. At present, a number of parallel CAD tools including a placement tool, a fault simulator and a VHDL simulator are supported. Results from a preliminary implementation are impressive and show the feasibility of the approach.

关键词： Design automation Concurrent computing Contracts Electrical capacitance tomography Software tools Pricing computer networks Circuits Cities and towns Testing

来源：评论

学校读者我要写书评

暂无评论

Dynamic load balancing strategies for conservative parallel simulations

Dynamic load balancing strategies for conservative parallel ...

引用

Workshop on Principles of Advanced and distributed Simulation (PADS)

作者： A. Boukerche S.K. Das Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas Denton TX USA

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 (1979) 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 processor. We 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 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.

关键词： Load management Computational modeling Protocols distributed computing Stress Testing Partitioning algorithms Discrete event simulation computer simulation Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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 efficient local address generation for the block-cyclic distribution

An efficient local address generation for the block-cyclic d...

引用

IEEE International Conference on Algorithms and Architectures for parallel Processing (ICAP)

作者： Oh-Young Kwon Tae-Geun Kim Tack-Don Han Sung-Bong Yang Shin-Dug Kim Distributed Computing Laboratory Systems Engineering Research Institute Taejon South Korea Parallel Processing System Laboratory Department of Computer Science Yonsei University Seoul South Korea

ISBN: (纸本)0780342291

In order to generate local addresses for an array section A(l:h:s) with block-cyclic distribution, an efficient compiling method is required. In this paper, two local address generation methods for the block-cyclic distribution are presented. One is a simple local address generation method that is modified from the virtual-block scheme. The other is a linear-time /spl Delta/M table construction method. The array elements of A(l:h:s) to be accessed at run-time build up a family of lines. By using the equation of the lines, a /spl Delta/M table can be generated in O(k) time. Experimental results show that a simple local address generation method has poor performance but a linear-time /spl Delta/M table generation method is faster than other algorithms in /spl Delta/M table generation time and access time for 10,000 array elements.

关键词： Runtime Equations distributed computing Systems engineering and theory parallel processing Laboratories computer science parallel languages Upper bound Automata

来源：评论

学校读者我要写书评

暂无评论

Adaptive blocks: A high performance data structure 97

Adaptive blocks: A high performance data structure

引用

1997 ACM/IEEE Conference on Supercomputing, SC 1997

作者： Stout, Quentin F. De Zeeuw, Darren L. Gombosi, Tamas I. Groth, Clinton P. T. Marshall, Hal G. Powell, Kenneth G. Electrical Engineering and Computer Science Center for Parallel Computing University of Michigan Ann Arbor MI 48109-2122 United States Space Physics Research Laboratory Department of Atmospheric Oceanic and Space Sciences University of Michigan Ann Arbor MI 48109-2143 United States Laboratory for Scientific Computation Center for Parallel Computing University of Michigan Ann Arbor MI 48109-2094 United States Department of Aerospace Engineering University of Michigan Ann Arbor MI 48109-2118 United States

ISBN: (纸本)0897919858

We examine a data structure which uses flexible "adaptivity" to obtain high performance for both serial and parallel computers. The data structure is an adaptive grid which partitions a given region into regular cells. Its closest relatives are cell-based tree decompositions, but there are several important differences which lead to significant performance advantages. Using this block data structure to support adaptive mesh refinement (AMR), we were able to sustain 17 GFLOPS in ideal magnetohydrodynamic (MHD) simulations of the solar wind emanating from the base of the solar corona, using a 512 processor Cray T3D at NASA Goddard. © 1997 ACM.

关键词： Magnetohydrodynamics

来源：评论

学校读者我要写书评

暂无评论

Video-based hypermedia for education-on-demand 96

Video-based hypermedia for education-on-demand

引用

4th ACM International Conference on Multimedia, MULTIMEDIA 1996

作者： Ma, Wei-Hsiu Lee, Yen-Jen Du, David H.C. McCahill, Mark P. Distributed Multimedia Research Center Department of Computer Science University of Minnesota United States Distributed Computing Services University of Minnesota United States

No abstract available.

ISBN: (纸本)0897918711

No abstract available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：