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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

194 篇 会议
76 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

147 篇 工学
- 118 篇 计算机科学与技术...
- 95 篇 软件工程
- 18 篇 控制科学与工程
- 16 篇 信息与通信工程
- 14 篇 力学（可授工学、理...
- 13 篇 电气工程
- 9 篇 生物工程
- 7 篇 电子科学与技术（可...
- 6 篇 动力工程及工程热...
- 5 篇 化学工程与技术
- 4 篇 机械工程
- 4 篇 航空宇航科学与技...
- 4 篇 生物医学工程（可授...
- 4 篇 安全科学与工程
- 4 篇 网络空间安全
96 篇 理学
- 54 篇 数学
- 32 篇 物理学
- 10 篇 化学
- 10 篇 生物学
- 9 篇 系统科学
- 7 篇 统计学（可授理学、...
- 2 篇 地球物理学
26 篇 管理学
- 18 篇 图书情报与档案管...
- 11 篇 管理科学与工程(可...
- 8 篇 工商管理
5 篇 法学
- 5 篇 社会学
3 篇 医学
- 3 篇 基础医学(可授医学...
- 3 篇 临床医学
2 篇 经济学
- 2 篇 应用经济学
2 篇 教育学
- 2 篇 教育学

主题

35 篇 computational mo...
27 篇 distributed comp...
26 篇 parallel process...
20 篇 concurrent compu...
16 篇 computer archite...
16 篇 discrete event s...
13 篇 grid computing
11 篇 application soft...
10 篇 computer simulat...
10 篇 workstations
9 篇 message passing
9 篇 libraries
8 篇 computer science
7 篇 scalability
7 篇 supercomputers
7 篇 processor schedu...
7 篇 cloud computing
6 篇 runtime
6 篇 logistics
6 篇 parallel program...

机构

24 篇 parallel and dis...
18 篇 centre for paral...
9 篇 edinburgh parall...
7 篇 parallel & distr...
7 篇 centre for paral...
7 篇 centre for paral...
7 篇 parallel and dis...
6 篇 parallel and dis...
5 篇 bhabha atomic re...
4 篇 edinburgh parall...
4 篇 institute of spa...
4 篇 edinburgh parall...
4 篇 fermilab ms234 p...
4 篇 intel corporatio...
3 篇 edinburgh parall...
3 篇 mackenzie presby...
3 篇 parallel & distr...
3 篇 mta sztaki compu...
3 篇 d-simlab program...
3 篇 parallel computi...

作者

16 篇 cai wentong
11 篇 kiss tamas
11 篇 tamas kiss
10 篇 s.j. turner
9 篇 simon j. e. tayl...
9 篇 low malcolm yoke...
9 篇 wentong cai
9 篇 kacsuk peter
9 篇 terstyanszky gab...
8 篇 zhou suiping
7 篇 stephen j. turne...
7 篇 turner stephen j...
7 篇 s.j.e. taylor
6 篇 winter stephen
6 篇 gabor terstyansz...
6 篇 peter kacsuk
6 篇 forbes lk
5 篇 t. delaitre
5 篇 suiping zhou
5 篇 s.p. dandamudi

语言

260 篇 英文
11 篇 其他

检索条件"机构=Centre For Parallel Computing Computing"

共 271 条记录，以下是131-140 订阅

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

详细简洁

排序：

Constrained migration of an atmospheric circulation model

Constrained migration of an atmospheric circulation model

引用

International Conference and Exhibition on High-Performance computing and Networking, HPCN EUROPE 1996

作者： Kandhai, B.D. Sloot, P.M.A. Huot, J.P. University of Amsterdam Computer Science and Physics Parallel Scientific Computing and Simulation Group Kruislaan 403 Amsterdam1098 SJ Netherlands European Space Research and Technology Centre Keplerlaan 1 Noordwijk2201 AZ Netherlands

ISBN: (纸本)9783540611424

In the migration of large production codes from sequential to parallel implementations a total rewriting of the original code is often prohibited. The reason for this is that very complicated codes took years of evolution to reach a stable and reliable state. Exploring the possibilities for parallelization should therefore be done with extreme care rather than by means of a complete rewrite from scratch. In this paper we discuss the migration of an atmospheric simulation program as an example of such ‘constrained migration’. We show that this type of migration allows for a fast and reliable, though not optimal, parallel implementation. Moreover it forces the researcher to identify locality and sequential hot spots in his code, thus guiding him into new strategies for a complete parallelization of the code. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

The SISO CSPI PDG standard for COTS simulation package interoperability reference models

The SISO CSPI PDG standard for COTS simulation package inter...

引用

SISO European Simulation Interoperability Workshop, EURO SIW 2008

作者： Taylor, Simon J.E. Strassburger, Steffen Turner, Stephen J. School of Information Systems Computing and Mathematics Brunel University Uxbridge Middx UB8 3PH United Kingdom School of Economic Sciences Ilmenau University of Technology Helmholtzplatz 98693 Ilmenau Germany Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore

ISBN: (纸本)9781605602004

Discrete-event simulation is used to analyze production and logistics problems in many areas such as commerce, defense, health, manufacturing and logistics. Commercial-off-the-shelf (COTS) Simulation Packages (CSPs) are black box visual interactive modelling environments that support the development of such simulations. These include CSPs such as Arena™, Anylogic™, Flexsim™, Simul8™, Witness™, etc. There have been various attempts to create distributed simulations with these CSPs and their tools, some with the High Level Architecture (HLA). These are complex and it is quite difficult to assess how a set of model/CSPs are actually interoperating. As the first in a series of standards aimed at standardizing how the HLA is used to support CSP-based distributed simulations, the Simulation Interoperability Standards Organization's (SISO) CSP Interoperability Product Development Group (CSPI PDG) has developed and standardized a set of Interoperability Reference Models (IRM) that are intended to clearly identify the interoperability capabilities of CSP-based distributed simulations. This paper presents the standard and summarizes the current activities of the PDG.

关键词： Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

Gasimo: A global address space simulation model 10

Gasimo: A global address space simulation model

引用

3rd International ICST Conference on Simulation Tools and Techniques, SIMUTools 2010

作者： Marurngsith, Worawan Ibbett, Roland N. Department of Computer Science Faculty of Science and Technology Thammasat University Pathum Thani12121 Thailand Edinburgh Parallel Computing Centre University of Edinburgh EdinburghEH9 3JZ United Kingdom

ISBN: (纸本)9789639799875

The partitioned global address space (PGAS) programming model has gained attention as a robust model suitable for a diversity of emerging concurrent architectures. PGAS offers more scalability over the former distributed shared memory system (DSM) by supporting asynchronous execution based on message passing. Combining asynchronous communication with the facility to make the location of data transparent, applications written in PGAS languages have to trade off the benefits of concurrent architectures with the overhead caused by accessing distant memories. Here we present an effective simulation model to reflect the cost of distant memory accesses on a PGAS system. The model, called Gasimo, simulates a generic PGAS execution environment on top of a cluster of homogeneous dual-core machines. Gasimo is a parallel extension of a particular DSM simulator, called DSiMCluster, which has been implemented on top of a discrete event simulation (DES) engine known as HASE. © Copyright 2010 ICST.

关键词： Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

A cots simulation package emulator (CSPE) for investigating cots simulation package interoperability

A cots simulation package emulator (CSPE) for investigating ...

引用

2005 Winter Simulation Conference

作者： Wang, Xiaoguang Turner, Stephen John Taylor, Simon J. E. Low, Malcolm Yoke Hean Gan, Boon Ping Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University 639798 Singapore Singapore Centre for Applied Simulation Modeling School of Information Systems Computing and Mathematics Brunel University Uxbridge UB8 3PH United Kingdom D-SIMLAB Programme Singapore Institute of Manufacturing Technology 71 Nanyang Drive 638075 Singapore Singapore

ISBN: (纸本)0780395204

Commercial Off-The-Shelf (COTS) Simulation Packages (CSPs) are widely used to facilitate the creation of simulation models using some kind of visual interactive interface. CSPs have "evolved" over the years and are well used to support modeling demands in different market niches and domains. However, in terms of distributed simulation, there is almost a complete lack of support for interoperability. The advent of the High Level Architecture (HLA) standard makes it possible to connect distributed model components together. The model components can be developed using specific CSPs best suited to the application area. In this paper, a CSP Emulator (CSPE) is proposed to investigate the interfaces between the CSPs and the HLA Runtime Infrastructure. In addition to support for standalone models as provided by current CSPs, the CSPE has some new features needed for building distributed models. An evaluation is conducted between CSPE and Simul8, one of the popular CSPs.

关键词： Electronics packaging

来源：评论

学校读者我要写书评

暂无评论

Adapted quality resource selection using the Grid reputation-policy trust management service

Adapted quality resource selection using the Grid reputation...

引用

IADIS International Conference Informatics 2009, Part of the IADIS Multi Conference on Computer Science and Information Systems, MCCSIS 2009

作者： Zetuny, Yonatan Terstyanszky, Gabor Winter, Stephen Kacsuk, Peter Centre for Parallel Computing University of Westminster 115 New Cavendish Street London W1W 6UW United Kingdom MTA SZTAKI 1111 Kende utca 13 Budapest Hungary

ISBN: (纸本)9789728924867

The concept of trust and reputation had a long profound impact on the way systems were measured in terms of their credibility and performance. This has consecutively lead into numerous reputation-based trust management systems being deployed for various computing environments as a decision support tool for assessing the trustworthiness of participating parties. In the context of Grid computing, reputation-based trust management systems play an important role for supporting coordinated resource sharing as they can reduce job execution failure by selecting relatively competent resources based on aggregated historical recommendations and given job requirements. In this paper, we present the Grid reputation-policy trust management service (GREPTrust) for managing resource selection in computational grids. This infrastructure level service encompasses a novel reputation-policy trust model, which enables service consumers (e.g. monitoring toolkits and resource brokers), to carry out an active participation in the trust and reputation evaluation processes. This is achieved by enabling service consumers to augment standard reputation queries with a set of reputation-policy statements rectified as trust decision strategies. Each strategy forms complete trust metrics blueprint for the reputation algorithm and therefore allows fine-grained resource selection adapted to specific job requirements. © 2009 IADIS.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Automated stowage planning for large containerships with improved safety and stability 10

Automated stowage planning for large containerships with imp...

引用

Simulation Winter Conference

作者： Min Zeng Malcolm Yoke Hean Low Wen Jing Hsu Shell Ying Huang Fan Liu Cho Aye Win Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University Singapore Singapore

ISBN: (纸本)9781424498642

Stowage planning for container ships is a core activity of shipping lines. As the size of containership increases, generating a stowage plan with good safety and stability for a large containership becomes increasingly difficult. In this paper, we present an automated stowage planning system for large containerships which consists of three modules: the stowage plan generator, the safety and stability adjustment module, and the optimization engine. This paper focuses on the safety and stability adjustment module which resolves the stability issues of a stowage plan by adjusting the distribution of container weights by stowing containers in alternative feasible locations and fine-tuning stability parameters through adjusting the ballast in tanks onboard. Using shipping data for a large 7000 TEUs containership on a multi-port voyage, we demonstrate that our system can generate stowage plans with improved safety and stability compared to those generated by experienced planners.

关键词： Containers Marine vehicles Planning Electronic ballasts Stability analysis Safety Loading

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An approach to support a single service provider address image for wide area networks environment

An approach to support a single service provider address ima...

引用

International Conference on parallel computing in Electrical Engineering (PARLEC)

作者： J.H. Abawajy Centre for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa ONT Canada

Request dispatching mechanism is at the heart of any cluster-computing environment. The goal is to support a single service provider address image for a given cluster of workstations. That is to say a given cluster publicises a single IP address and client requests are addressed to that IP address. This means, from the client's viewpoint, there are no nodes in the cluster, only services and the network names through which they are accessible. As a result, the cluster becomes a single virtual node. We propose a simple and elegant scheme for making the cluster transparent to clients outside the cluster such that the clients can interact with the cluster as if it were a single high-performance and highly available resource.

关键词： Wide area networks Workstations Computer architecture Network servers Dispatching Local area networks Distributed computing Computer science Heart Buildings

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of nested-loop join processing on networks of workstations

Performance evaluation of nested-loop join processing on net...

引用

International Conference on parallel and Distributed Systems (ICPADS)

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

Networks of workstations (NOWs) are attractive for parallel processing due to their cost advantage. This paper investigates the performance issues in processing join operations and the inherent tradeoff in the networked workstation environment. Specifically, we look at the performance of the nested-loop join algorithm. Since NOWs are heterogeneous in nature, load sharing is important for their performance. We evaluated the performance of three load sharing methods: static equal, static proportional and dynamic scheduling with fixed-chunk size. The three scheduling methods are evaluated on an experimental heterogeneous network of workstations with non-query background loads. Our experimental result suggest that, when there is no background load, dynamic scheduling outperforms static equal scheduling (up to 40%) and marginally better (about 10% better speedup) than the static proportional scheduling. When there is dynamic background load on nodes, dynamic scheduling provides substantial performance improvement over the static proportional scheduling (up to 50%) and static equal scheduling (up to about 100%). In all cases, selection of an appropriate chunk size is important in dynamic scheduling.

关键词： Workstations Dynamic scheduling Concurrent computing Databases parallel processing Master-slave Processor scheduling Application software Throughput Distributed computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：