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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

197 篇 会议
93 篇 期刊文献
5 册 图书

馆藏范围

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

日期分布

学科分类号

171 篇 工学
- 141 篇 计算机科学与技术...
- 99 篇 软件工程
- 29 篇 信息与通信工程
- 22 篇 控制科学与工程
- 19 篇 生物工程
- 14 篇 电气工程
- 10 篇 电子科学与技术（可...
- 7 篇 机械工程
- 7 篇 网络空间安全
- 5 篇 材料科学与工程（可...
- 5 篇 动力工程及工程热...
- 4 篇 土木工程
- 4 篇 生物医学工程（可授...
- 3 篇 光学工程
- 3 篇 建筑学
- 3 篇 交通运输工程
66 篇 理学
- 38 篇 数学
- 19 篇 生物学
- 8 篇 化学
- 8 篇 系统科学
- 7 篇 物理学
- 5 篇 统计学（可授理学、...
37 篇 管理学
- 26 篇 管理科学与工程(可...
- 17 篇 工商管理
- 12 篇 图书情报与档案管...
10 篇 法学
- 7 篇 社会学
- 3 篇 法学
5 篇 医学
- 4 篇 公共卫生与预防医...
4 篇 教育学
- 4 篇 教育学
3 篇 经济学
- 3 篇 应用经济学
2 篇 农学
2 篇 军事学
1 篇 艺术学

主题

32 篇 distributed comp...
25 篇 computer science
18 篇 computational mo...
17 篇 concurrent compu...
15 篇 resource managem...
12 篇 quality of servi...
11 篇 computer archite...
10 篇 machine learning
9 篇 grid computing
8 篇 application soft...
8 篇 processor schedu...
8 篇 computer network...
7 篇 parallel algorit...
7 篇 deep learning
7 篇 deep neural netw...
7 篇 feature extracti...
6 篇 time factors
6 篇 interference
6 篇 high performance...
6 篇 testing

机构

37 篇 school of cyber ...
36 篇 school of comput...
25 篇 national enginee...
23 篇 hubei key labora...
23 篇 services computi...
23 篇 hubei engineerin...
23 篇 cluster and grid...
17 篇 school of softwa...
17 篇 parallel and dis...
15 篇 school of inform...
9 篇 jinyinhu laborat...
7 篇 centre for paral...
7 篇 national enginee...
7 篇 science and tech...
6 篇 huazhong univers...
6 篇 center for paral...
5 篇 parallel and dis...
5 篇 department of co...
5 篇 parallel and dis...
5 篇 school of cyber ...

作者

30 篇 jin hai
23 篇 hai jin
18 篇 li kuan-ching
18 篇 yang chao-tung
17 篇 hu shengshan
12 篇 zhang leo yu
12 篇 albert y. zomaya
12 篇 li minghui
11 篇 zomaya albert y.
11 篇 zhou ziqi
11 篇 cai wentong
10 篇 wan wei
8 篇 deqing zou
8 篇 zahir tari
7 篇 wentong cai
7 篇 shengshan hu
6 篇 javid taheri
6 篇 minghui li
6 篇 dehne f
6 篇 dandamudi sivara...

语言

257 篇 英文
36 篇 其他
2 篇 中文

检索条件"机构=Parallel and Distributed Computing Center School of Computer Science"

共 295 条记录，以下是251-260 订阅

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

详细简洁

排序：

A novel application development environment for large-scale scientific computations 00

A novel application development environment for large-scale ...

引用

Proceedings of the 14th international conference on Supercomputing

作者： X. Shen W. Liao A. Choudhary G. Memik M. Kandemir S. More G. Thiruvathukal A. Singh Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston IL Department of Computer Science and Engineering The Pennsylvania State University University Park PA School of Computing Telecommunications and Information Sciences JHPC Laboratory Depaul University

Our results demonstrate that our novel application development environment provides both ease-of-use and high performance for large-scale, I/O-intensive scientific applications.

ISBN: (纸本)9781581132700

Our results demonstrate that our novel application development environment provides both ease-of-use and high performance for large-scale, I/O-intensive scientific applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Buffer management in wormhole-routed torus multicomputer networks 7th

Buffer management in wormhole-routed torus multicomputer net...

引用

7th International Conference on High-Performance computing and Networking, HPCN Europe 1999

作者： Kotapati, Kamala Dandamudi, Sivarama P. Newbridge Networks Kanata Canada Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada

ISBN: (纸本)3540658211

This paper focuses on buffer management issues in wormhole-routed torus multicomputer networks. The commonly used buffer organizations are the centralized and dedicated buffer organizations. The results presented in this paper indicate that the dedicated buffer organization provides better performance than the centralized organization under uniform traffic. Under high hot-spot traffic, the centralized organization outperforms the dedicated. The hybrid buffer organization proposed in this paper inherits the merits of the centralized and distributed organizations. The results presented suggest that the hybrid buffer organization can be designed to configure dynamically from the dedicated to centralized depending on the traffic conditions. © Springer-Verlag Berlin Heidelberg 1999.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Centralized architecture for parallel query processing on networks of workstations 7th

Centralized architecture for parallel query processing on ne...

引用

7th International Conference on High-Performance computing and Networking, HPCN Europe 1999

作者： Zeng, Sijun Dandamudi, Sivarama P. CrossKeys System Corporation Kanata Canada Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada

ISBN: (纸本)3540658211

Network of workstations (NOW) is a cost-effective alternative to a multiprocessor system. Here we propose a centralized architecture for parallel query processing on network of workstations. We describe a three-level processing strategy and evaluate its performance. The top two levels use a space-sharing technique to assign a partition to a query. The third-level uses a chunk-based load sharing policy to accommodate dynamic local load present on the workstations. To evaluate the performance of this three-level strategy, we have implemented it using PVM on a Pentium-based NOW. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Comparative Study of Adaptive and Hierarchical Load Sharing Policies for distributed Systems 13

A Comparative Study of Adaptive and Hierarchical Load Sharin...

引用

13th International Conference on computers and Their Applications, CATA 1998

作者： Dandamudi, Sivarama P. Lo, Michael Kwok Cheong Centre for Parallel and Distributed Computing School of Computer Science Carleton University OttawaONK1S 5B6 Canada Nortel Technologies OttawaON Canada

ISBN: (纸本)9781618395443

Dynamic load sharing policies take system state into account in making load distribution decisions. The state information can be maintained in one of two basic ways: distributed or centralized. Two principal types of policies that belong to the distributed scheme are the sender-initiated and receiver-initiated policies. In the centralized scheme, a central coordinator node is responsible for collecting system state information. distributed policies do not perform as well as the centralized policy. Performance of distributed policies is sensitive to variance in job service times and inter-arrival times. distributed policies, however, are scalable whereas the centralized policy can cause bottleneck and fault-tolerance problems for large systems. An adaptive distributed policy has been proposed that dynamically switches between sender-initiated and receiver-initiated policies depending on the system state. Here we propose a new global hierarchical load sharing policy that minimizes the drawbacks associated with the distributed and centralized policies while retaining their advantages. We provide a performance comparison of these policies and show that the proposed hierarchical policy provides the best performance among the distributed and adaptive policies for all the various system and workload parameters considered. © 13th International Conference on computers and Their Applications 1998, CATA 1998. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Performance of hard real-time transaction scheduling policies in parallel database systems

Performance of hard real-time transaction scheduling policie...

引用

International Symposium on Modeling, Analysis and Simulation of computer and Telecommunication Systems (MASCOTS)

作者： S. Takkar S.P. Dandamudi Centre for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa ONT Canada

Real-time transactions, in addition to preserving consistency of the database as in traditional transactions, have to meet the deadlines. Scheduling real-time transactions in parallel database systems has not received much attention. This paper focuses on real-time transaction scheduling in shared-nothing parallel database systems. We evaluate the performance of a new priority-based scheduling policy, in which all scheduling decisions are made locally by each node. In contrast, several other algorithms, proposed for the distributed systems, require communication among the nodes to globally synchronize their local block and abort decisions. Such synchronization can deteriorate performance as real-time transactions will have to meet deadlines. We use miss ratio as the performance metric and show that, in general, the new policy provides a superior performance for the workload and system parameters considered in this study.

关键词： Real time systems Database systems Transaction databases Processor scheduling System recovery Timing distributed computing computer science distributed databases Measurement

来源：评论

学校读者我要写书评

暂无评论

Hierarchical architecture for parallel query processing on networks of workstations

Hierarchical architecture for parallel query processing on n...

引用

International Conference on High Performance computing

作者： Boquan Xie S.P. Dandamudi Centre for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa ONT Canada Nortel Technologies Inc. Ottawa Canada

Networks of workstations (NOWs) are cost-effective alternatives to multiprocessor systems. Recently, NOWs have been proposed for parallel query processing. Idle CPU cycles of workstations in a NOW-based system can be used to process database query operations. We report on the performance of the hierarchical architecture for parallel query processing on a NOW. We have implemented the hierarchical architecture using PVM on a Pentium-based NOW. The experimental results reported suggest that the hierarchical architecture is successful in achieving good scale-ups and speedups indicating that the idle processor cycles are effectively used for query processing. The hierarchical system can also handle both light and heavy workloads in a load sharing fashion. Our results also suggest that the performance is sensitive to the minimum fragmentation size (chunk size) for partial operations and the structure of queries.

关键词： Query processing Workstations Database systems computer architecture Delay Performance gain distributed computing computer science Transaction databases Personal communication networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A hierarchical processor scheduling policy for distributed-memory multicomputer systems

A hierarchical processor scheduling policy for distributed-m...

引用

International Conference on High Performance computing

作者： S.P. Dandamudi T.K. Thyagaraj Centre for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa ONT Canada

Processor scheduling policies for distributed memory systems can be divided into space sharing or time sharing policies. In space sharing, the set of processors in the system is partitioned and each partition is assigned for the exclusive use of a job. In time sharing policies, on the other hand, none of the processors is given exclusively to jobs; instead, several jobs share the processors (for example, in a round robin fashion). There are advantages and disadvantages associated with each type of policy. Typically, space sharing policies are good at low to moderate system loads and when job parallelism does not vary much. However, at high system loads and widely varying job parallelism, time sharing policies provide a better performance. We propose a new policy that is based on a hierarchical organization that incorporates the merits of these two types of policies. The new policy is a hybrid policy that uses both space sharing as well as time sharing to achieve better performance. We demonstrate that, at most system loads of interest, the proposed policy outperforms both space sharing and time sharing policies by a wide margin.

关键词： Processor scheduling Time sharing computer systems Round robin parallel processing distributed computing computer science Large-scale systems Concurrent computing Message passing Delay

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共30页 << < 21 22 23 24 25 26 27 28 29 30 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：