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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,139 篇 会议
30 篇 期刊文献
5 册 图书

馆藏范围

1,174 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

575 篇 工学
- 540 篇 计算机科学与技术...
- 343 篇 软件工程
- 76 篇 控制科学与工程
- 74 篇 信息与通信工程
- 58 篇 电气工程
- 45 篇 电子科学与技术（可...
- 10 篇 化学工程与技术
- 7 篇 机械工程
- 7 篇 材料科学与工程（可...
- 6 篇 力学（可授工学、理...
- 6 篇 动力工程及工程热...
- 5 篇 建筑学
- 5 篇 土木工程
- 5 篇 生物工程
- 4 篇 仪器科学与技术
- 4 篇 交通运输工程
- 4 篇 生物医学工程（可授...
- 4 篇 网络空间安全
182 篇 理学
- 140 篇 数学
- 40 篇 系统科学
- 38 篇 统计学（可授理学、...
- 18 篇 物理学
- 13 篇 化学
- 9 篇 生物学
38 篇 管理学
- 33 篇 管理科学与工程(可...
- 21 篇 工商管理
- 7 篇 图书情报与档案管...
8 篇 教育学
- 8 篇 教育学
7 篇 经济学
- 7 篇 应用经济学
4 篇 法学
- 4 篇 社会学
4 篇 军事学
2 篇 医学
1 篇 农学

主题

241 篇 computational mo...
218 篇 computer simulat...
206 篇 discrete event s...
115 篇 concurrent compu...
82 篇 distributed comp...
79 篇 computer science
72 篇 parallel process...
69 篇 protocols
53 篇 time warp simula...
53 篇 analytical model...
52 篇 computer archite...
48 篇 large-scale syst...
47 篇 computer network...
46 篇 costs
43 篇 parallel process...
40 篇 circuit simulati...
36 篇 predictive model...
34 篇 hardware
34 篇 delay
33 篇 runtime

机构

18 篇 college of compu...
12 篇 school of comput...
9 篇 georgia inst tec...
9 篇 department of co...
8 篇 dipartimento di ...
8 篇 department of co...
7 篇 school of comput...
6 篇 coll of william ...
6 篇 department of co...
6 篇 georgia inst of ...
6 篇 univ roma la sap...
6 篇 computer science...
5 篇 gintic institute...
5 篇 rensselaer polyt...
5 篇 school of applie...
5 篇 school of comput...
5 篇 georgia institut...
4 篇 mitre corporatio...
4 篇 georgia inst of ...
4 篇 department of el...

作者

23 篇 wentong cai
17 篇 fujimoto richard...
13 篇 d.m. nicol
13 篇 cai wentong
12 篇 nicol david m.
12 篇 r.m. fujimoto
10 篇 f. quaglia
10 篇 r. bagrodia
9 篇 rajive bagrodia
9 篇 s.j. turner
9 篇 bagrodia rajive
8 篇 r. fujimoto
8 篇 b. unger
8 篇 david m. nicol
7 篇 p.a. wilsey
7 篇 shell ying huang
7 篇 quaglia f
7 篇 richard m. fujim...
7 篇 yu-an chen
7 篇 wilsey philip a.

语言

1,162 篇 英文
7 篇 俄文
4 篇 中文
1 篇 其他

检索条件"任意字段=Proceedings of the thirteenth workshop on Parallel and distributed simulation"

共 1174 条记录，以下是1001-1010 订阅

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

详细简洁

排序：

Efficient pseudorecursive evaluation schemes for non-adaptive sparse grids 1

引用

2nd workshop on Sparse Grids and Applications, SGA 2012

作者： Buse, Gerrit Pflüger, Dirk Jacob, Riko TU München München Germany Institute for Parallel and Distributed Systems Universität Stuttgart Stuttgart Germany ETH Zurich Zurich Switzerland

ISBN: (数字)9783319045375

ISBN: (纸本)9783319045368

In this work we propose novel algorithms for storing and evaluating sparse grid functions, operating on regular (not spatially adaptive), yet potentially dimensionally adaptive grid types. Besides regular sparse grids our approach includes truncated grids, both with and without boundary grid points. Similar to the implicit data structures proposed in Feuersänger (Dünngitterverfahren für hochdimensionale elliptische partielle Differntialgleichungen. Diploma Thesis, Institut für Numerische simulation, Universität Bonn, 2005) and Murarasu et al. (proceedings of the 16th ACM Symposium on Principles and Practice of parallel Programming. Cambridge University Press, New York, 2011, pp. 25–34) we also define a bijective mapping from the multi-dimensional space of grid points to a contiguous index, such that the grid data can be stored in a simple array without overhead. Our approach is especially well-suited to exploit all levels of current commodity hardware, including cache-levels and vector extensions. Furthermore, this kind of data structure is extremely attractive for today’s real-time applications, as it gives direct access to the hierarchical structure of the grids, while outperforming other common sparse grid structures (hash maps, etc.) which do not match with modern compute platforms that well. For dimensionality d ≤10 we achieve good speedups on a 12 core Intel Westmere-EP NUMA platform compared to the results presented in Murarasu et al. (proceedings of the International Conference on Computational Science—ICCS 2012. Procedia Computer Science, 2012). As we show, this also holds for the results obtained on Nvidia Fermi GPUs, for which we observe speedups over our own CPU implementation of up to 4.5 when dealing with moderate dimensionality. In high-dimensional settings, in the order of tens to hundreds of dimensions, our sparse grid evaluation kernels on the CPU outperform any other known implementation. © Springer International Publishing Switzerland 2014.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Synchronous relaxation for parallel Ising spin simulations

Synchronous relaxation for parallel Ising spin simulations

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： B. Lubachevsky A. Weiss Bell Laboratories Murray Hill NJ USA

ISBN: (纸本)076951104X

A new parallel algorithm for simulating Ising spin systems is presented. The sequential prototype is the n-fold way algorithm, which is efficient but is hard to parallelize using conservative methods. Our parallel algorithm is optimistic. Unlike other optimistic algorithms, e.g., Time Warp, our algorithm is synchronous. It also belongs to the class of simulations known as "relaxation"; hence it is named "synchronous relaxation." We derive performance guarantees for this algorithm. If N is the number of PEs, then under weak assumptions we show that the number of correct events processed per unit of time is, on average, at least of order N/logN. All communication delays, processing time, and busy waits are taken into account.

关键词： Computational modeling parallel algorithms Physics computing Temperature Prototypes Delay effects Magnetization Materials science and technology Lattices Nearest neighbor searches

来源：评论

学校读者我要写书评

暂无评论

Practical parallel simulation applied to aviation modeling 01

Practical parallel simulation applied to aviation modeling

引用

proceedings of the fifteenth workshop on parallel and distributed simulation

作者： Frederick Wieland Center for Advanced Aviation Systems Development The MITRE Corporation 1820 Dolley Madison Dr. McLean VA

ISBN: (纸本)9780769511047

This paper analyzes the Detailed Policy Assessment Tool (DPAT) as an example of a practical real-world aviation simulation that uses optimistic simulation technology. We present a review of analyses that have used DPAT results to support their conclusions, and discuss the design and performance of the system in the context of parallel simulation. The thrust of this paper is to explain how DPAT avoids some of the problems associated with optimistic simulation, while exploiting its strengths. A key conclusion is that parallel simulation technology, particularly optimistic synchronization, needs to be built into the product from its conceptual design through implementation, as opposed to adding it afterwards.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Lock-free scheduling of logical processes in parallel simulation

Lock-free scheduling of logical processes in parallel simula...

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： J. Liu D.M. Nicol King Tan Department of Computer Science Dartmouth College Hanover NH USA

ISBN: (纸本)076951104X

With fixed lookahead information in a simulation model, the overhead of asynchronous conservative parallel simulation lies in the mechanism used for propagating time updates in order for logical processes to safely advance their local simulation clocks. Studies have shown that a good scheduling algorithm should preferentially schedule processes containing events on the critical path. This paper introduces a lock-free algorithm for scheduling logical processes in conservative parallel discrete-event simulation on shared-memory multiprocessor machines. The algorithm uses fetch and add operations that help avoid inefficiencies associated with using locks. The lock-free algorithm is robust. Experiments show that, compared with the scheduling algorithm using locks, the lock-free algorithm exhibits better performance when the number of logical processes assigned to each processor is small or when the workload becomes significant. In models with large number of logical processes, our algorithm shows only modest increase in execution time due to the overhead in the algorithm for extra bookkeeping.

关键词： Discrete event simulation Scheduling algorithm Computational modeling Processor scheduling Computer simulation Clocks Contracts Out of order Error correction Computer science

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of a communication optimization model in network-based parallel computing

Performance evaluation of a communication optimization model...

引用

International Conference on parallel Processing workshops (ICPPW)

作者： Ming Zhu Wentong Cai Bu-Sung Lee School of Computer Engineering Nanyang Technological University Singapore Singapore

Network based distributed computing has been gaining popularity over the past decade. Many parallel programming languages and related parallel programming modes are becoming widely accepted. However, the execution of parallel applications on distributed systems has been hampered by the high communication overhead. To reduce the communication overhead and the completion time of a parallel application, we propose a key message model for parallel computing on network of workstations (NOWs). In the key message model, all messages generated in a key message path are prioritized. A key message path in a task graph is defined as the path that is optimized by the key message algorithm. All messages generated in a key message path are prioritized. Besides, the key message algorithm automatically finds the key message paths. In this paper, we first describe the algorithm that identifies the key messages to be prioritized in a parallel application, then analyze the cost of the algorithm, and finally evaluate the performance of the algorithm in a simulation. Our preliminary analysis of the algorithm shows improvement over the system which does not use prioritization scheme.

关键词： Intelligent networks parallel processing TCPIP Protocols distributed computing parallel programming Performance analysis Algorithm design and analysis Costs Analytical models

来源：评论

学校读者我要写书评

暂无评论

Conservative parallel simulation of ATM networks 96

Conservative parallel simulation of ATM networks

引用

proceedings of the tenth workshop on parallel and distributed simulation

作者： John G. Cleary Jya-Jang Tsai Department of Computer Science University of Waikato New Zealand

ISBN: (纸本)9780818675393

A new Conservative algorithm for both parallel and sequential simulation of networks is described. The technique is motivated by the construction of a high performance simulator for ATM networks. It permits very fast execution of models of ATM systems, both sequentially and in parallel. A simple analysis of the performance of the system is made. Initial performance results from parallel and sequential implementations are presented and compared with comparable results from an optimistic TimeWarp based simulator. It is shown that the conservative simulator performs well when the "density" of messages in the simulated system is high, a condition which is likely to hold in many interesting ATM scenarios.

关键词： parallel simulation ATM Networks

来源：评论

学校读者我要写书评

暂无评论

Optimal and suboptimal reliable scheduling of precedence-constrained tasks in heterogeneous distributed computing

Optimal and suboptimal reliable scheduling of precedence-con...

引用

International Conference on parallel Processing workshops (ICPPW)

作者： A. Dogan F. Ozguner Department of Electrical Engineering Ohio State Uinversity Columbus OH USA

Introduces algorithms which can produce both optimal and suboptimal task assignments to minimize the probability of failure of an application executing on a heterogeneous distributed computing system. A cost function which defines this probability under a given task assignment is derived. To find optimal and suboptimal task assignments efficiently, a reliable matching and scheduling problem is converted into a state-space search problem in which the cost function derived is used to guide the search. The A* algorithm for finding optimal task assignments and the A*/sub m/ and hill-climbing algorithms for finding suboptimal task assignments are presented. simulation results are provided to confirm the performance of the proposed algorithms.

关键词： Cost function distributed computing Processor scheduling Computer applications Concurrent computing Scheduling algorithm Search problems Computational modeling Personal communication networks Workstations

来源：评论

学校读者我要写书评

暂无评论

The lookahead in a user-transparent conservative parallel simulator 02

The lookahead in a user-transparent conservative parallel si...

引用

proceedings of the sixteenth workshop on parallel and distributed simulation

作者： Viliam Solcany Jiri Safarik Slovak University of Technology Ilkovicova 3 812 19 Bratislava Slovak Republic University of West Bohemia Univerzitni 8 306 14 Plzen Czech Republic

ISBN: (纸本)9780769516080

One of the difficulties inherent to conservative parallel discrete event simulation (PDES) is the need for extraction and explicit specification of the lookahead. In this paper we propose a simulator design which allows users to build simulation models with lookahead transparently. This is based on the cooperation between PDES experts and the users, and on the reusability of model components. We introduce the principal design of the simulator and give the results related to its lookahead.

关键词： Reusability Conservative parallel simulation User-transparency Lookahead

来源：评论

学校读者我要写书评

暂无评论

The Annai/PMA performance monitor and analyzer

The Annai/PMA performance monitor and analyzer

引用

International Symposium on Modeling, Analysis and simulation of Computer and Telecommunication Systems (MASCOTS)

作者： B.J.N. Wylie A. Endo Centro Svizzero di Calcolo Scientific Manno Switzerland Swiss Branch NEC European Supercomputer Systems Manno Switzerland

The Annai integrated tool environment helps exploit the inherent power of distributed-memory parallel computers with standardized languages and convenient programming support. Portable application development is supported in High Performance Fortran and/or with explicit message-passing, using MPI as the machine interface. Integration within a unified tool environment allows the performance monitor and analyzer (PMA) component to interact with source code browsers and the loaded executable on the same terms as when using the parallel debugger. Data distribution and other program information furnished by the parallelization support and compilation systems is also exploited for additional insight. Powerful, directed analysis and interactive graphical summaries address scalability, while detailed charts of the time-varying behavior of individual processes and communication events can also be browsed when desired, always retaining essential reference to the original program source code.

关键词： Performance analysis Debugging Concurrent computing parallel programming parallel processing Prototypes Computerized monitoring distributed computing Computer languages Testing

来源：评论

学校读者我要写书评

暂无评论

On extending parallelism to serial simulators 95

On extending parallelism to serial simulators

引用

proceedings of the ninth workshop on parallel and distributed simulation

作者： David Nicol Philip Heidelberger Department of Computer Science The College of William and Mary Williamsburg VA IBM T.J. Watson Research Center P.O. Box 704 Yorktown Heights NY

ISBN: (纸本)9780818671203

This paper describes an approach to discrete event simulation modeling that appears to be effective for developing portable and efficient parallel execution of models of large distributed systems and communication networks. In this approach, the modeler develops sub-models using an existing sequential simulation modeling tool, using the full expressive power of the tool. A set of modeling language extensions permit automatically synchronized communication between sub-models; however, the automation requires that any such communication must take a non-zero amount of simulation time. Within this modeling paradigm, a variety of conservative synchronization protocols can transparently support conservative execution of sub-models on potentially different processors. A specific implementation of this approach, U.P.S. (Utilitarian parallel Simulator), is described, along with performance results on the Intel Paragon.

关键词： utilitarian parallel simulator protocols discrete event simulation modeling performance discrete event simulation modeling language extensions large distributed systems synchronization protocols synchronisation communication networks Intel Paragon serial simulators

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共118页 << < 97 98 99 100 101 102 103 104 105 106 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：