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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,140 篇 会议
30 篇 期刊文献
5 册 图书

馆藏范围

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

日期分布

学科分类号

576 篇 工学
- 541 篇 计算机科学与技术...
- 344 篇 软件工程
- 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 篇 中文
2 篇 其他

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

共 1175 条记录，以下是1121-1130 订阅

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

详细简洁

排序：

Optimistic simulation of parallel architectures using program executables 96

Optimistic simulation of parallel architectures using progra...

引用

proceedings of the tenth workshop on parallel and distributed simulation

作者： Sashikanth Chandrasekaran Mark D. Hill Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton Street Madison WI

ISBN: (纸本)9780818675393

A key tool of computer architects is computer simulation at the level of detail that can execute program executables. The time and memory requirements of such simulations can be enormous, especially when the machine under design-the target-is a parallel machine. Thus, it is attractive to use parallel simulation, as successfully demonstrated by the Wisconsin Wind Tunnel (WWT). WWT uses a conservative simulation algorithm and eschews network simulation to make lookahead adequate. Nevertheless, we find most of WWT's slowdown to be due to the synchronization overhead in the conservative simulation algorithm. This paper examines the use of optimistic algorithms to perform parallel simulations of parallel machines. We first show that we can make optimistic algorithms work correctly even with WWT's direct execution of program executables. We checkpoint processor registers (integer, floating-point, and condition codes) and use executable editing to log the value of memory words just before they are overwritten by stores. Second, we consider the performance of two optimistic algorithms. The first executes programs optimistically, but performs protocol events (e.g., sending messages) conservatively. The second executes everything optimistically and is similar to Time Warp with lazy message cancellation. Unfortunately, both approaches make parallel simulation performance worse for the default WWT assumptions. We conclude by speculating on the performance of optimistic simulation when simulating (1) target network details, and (2) on hosts with high message latencies and no synchronization hardware.

关键词： Optimistic simulation State Saving parallel Machines Direct Execution

来源：评论

学校读者我要写书评

暂无评论

Semi-asynchronous checkpointing for optimistic simulation on a Myrinet based NOW

Semi-asynchronous checkpointing for optimistic simulation on...

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： F. Quaglia A. Santoro Dipartimento di Informatica e Sistemistica Università di Roma La Sapienza Rome Italy

ISBN: (纸本)076951104X

Great effort has been devoted to the design of optimized checkpointing strategies for optimistic parallel discrete event simulators. On the other hand, there is less work being done in the direction of improving the execution mode of any single checkpoint operation. Specifically, checkpoint operations are typically charged to the CPU, thus leading to freezing of the simulation application while checkpointing is in progress, i.e. the execution mode of the checkpointing protocol is typically synchronous. In this paper, we focus on improvements of the execution mode and present a software architecture, designed for Myrinet-based networks of workstations (NOWs), to avoid application freezing during any checkpoint operation, thus moving the execution itself towards an asynchronous mode. This is done by charging checkpoint operations to a hardware component that is distinct from the CPU, namely a DMA (direct memory access) engine. On the other hand, totally asynchronous checkpointing could suffer from data inconsistency whenever the content of a state buffer is accessed for further modifications while a checkpoint operation involving it has not yet completed. To avoid this, the architecture includes functionalities for resynchronization on demand. We have used these functionalities to implement an execution mode of the checkpointing protocol that we refer to as semi-asynchronous. By the results of an experimental study, we argue that the semi-asynchronous mode can be an effective solution to almost completely remove the delay associated with any checkpoint operation from the completion time of the simulation.

关键词： Checkpointing Design optimization Application software Discrete event simulation Protocols Software architecture Software design Workstations Hardware Engines

来源：评论

学校读者我要写书评

暂无评论

An improved cost function for static partitioning of parallel circuit simulations using a conservative synchronization protocol 95

An improved cost function for static partitioning of paralle...

引用

proceedings of the ninth workshop on parallel and distributed simulation

作者： Kevin L. Kapp Thomas C. Hartrum Tom S. Wailes Department of Electrical and Computer Engineering School of Engineering Air Force Institute of Technology

ISBN: (纸本)9780818671203

Distributing computation among multiple processors is one approach to reducing simulation time for large VLSI circuit designs. However, parallel simulation introduces the problem of how to partition the logic gates and system behaviors of the circuit among the available processors in order to obtain maximum speedup. A complicating factor that is often ignored is the effect of the time-synchronization protocol (conservative [1] or optimistic [2]). Inherent in the partitioning problem is the question of how to effectively measure the relative quality of a partition. This paper describes an objective cost function for measuring the relative quality of a task partition that includes a synchronization factor for a conservative NULL-message protocol. A graph-based partitioning tool based on this cost function is used to perform the static task allocation for parallel simulation of a structural VHDL circuit. Results for two 1000 – 4000 gate circuits demonstrate that the additional consideration of the synchronization protocol in the cost function generates partitions that exhibit improved speedup.

关键词： logic CAD time-synchronization protocol parallel programming logic partitioning static partitioning conservative synchronization protocol VLSI circuit design parallel simulation parallel circuit simulations objective cost function graph-based partitioning tool discrete event simulation circuit analysis computing synchronization protocol

来源：评论

学校读者我要写书评

暂无评论

Colored Petri net methods for performance analysis of scalable high-speed interconnects

Colored Petri net methods for performance analysis of scalab...

引用

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

作者： L. Cherkasova A. Davis V. Kotov T. Rokicki Hewlett Packard Laboratories Palo Alto CA USA Comptuer Science Department University of Stanford Stanford CA USA

Large concurrent or distributed systems have proven notoriously difficult to comprehend due to their combinatoric complexity. There is a clear need for thorough formal system modeling at all design stages. Ease of use and validation capability are important criteria in method selection. It is important that the selection permit evaluation of design details with respect to performance and behavioral goals. Net models are a likely candidate to achieve the requisite needs of such a modeling environment. They provide both graphical and mathematical system modeling views which inherently enable both quantitative and qualitative analysis of the design. To demonstrate this claim, a colored Petri Net model and performance analysis of a particular scalable multiprocessor interconnect fabric is presented. The fundamental component of this fabric is an adaptive routing device, R2. The R2 fabric is based on the interconnection scheme used in the Mayfly parallel processing system.< >

关键词： Performance analysis Fabrics Routing Petri nets Modeling Topology Milling machines parallel processing Computer science Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A scheduling algorithm to optimize real-world applications

A scheduling algorithm to optimize real-world applications

引用

International Conference on distributed Computing Systems workshop

作者： M. Solar M. Inostroza University of Santiago Chile

This article presents a scheduling algorithm that assigns tasks represented in a directed acyclic graph (DAG). The behavior of the proposed algorithm is compared with the dominant sequence clustering (DSC) algorithm on a set of DAG tests. The tests were carried out on two sets of DAGs, one with tasks of arbitrary duration, and the other with tasks of unit time duration. When comparing the results for each algorithm in terms of parallel computation time, the proposed algorithm is superior in 75% of the cases, equal in 20% of the tests, and in those cases in which DSC outperforms the proposed algorithm (5% of the cases), it can be seen that the planning carried out by DSC uses a greater number of processors than the proposed algorithm, so that the performance in terms of CPU use is lower for DSC. The results obtained show that the proposed algorithm is superior in 100% of the cases when considering the number of processors used.

关键词： Scheduling algorithm Clustering algorithms Testing Concurrent computing parallel machines Computational modeling Aerospace simulation Process planning Processor scheduling Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

The SPEEDES Persistence Framework and the Standard simulation Architecture 03

The SPEEDES Persistence Framework and the Standard Simulatio...

引用

proceedings of the seventeenth workshop on parallel and distributed simulation

作者： Dr. Jeffrey S. Steinman Jennifer W. Wong RAM Laboratories 10525 Vista Sorrento Parkway Suite 220 San Diego CA

ISBN: (纸本)9780769519708

This paper provides an overview of the SPEEDESpersistence framework that is currently used to automatecheckpoint/restart for the Joint simulation System. Thepersistence framework interfaces are documented in thispaper and are proposed standards for the Standardsimulation *** persistence framework fundamentally keeps trackof memory allocations and pointer references within ahigh-speed internal database linked with *** persistence, an object, and the collection of objectsit recursively references through pointers, can beautomatically packed into a buffer that is written to diskor sent as a message to another machine. Later, thatbuffer can be used to reconstruct the object and all of itsrecursively referenced objects. The reconstructed objectswill likely be instantiated at different memory *** persistence framework automatically updates allaffected pointer references to account for this *** persistence framework is fully integrated with theSPEEDES rollback infrastructure and built-in containerclass libraries that include an implementation of theStandard Template Library. These utilities automatesupport for optimistic event processing required by manyhigh-performance parallel and distributed timemanagement algorithms. In the future, persistence willenable dynamic load balancing algorithms to migratecomplex objects to different processors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A causality based time management mechanism for federated simulation

A causality based time management mechanism for federated si...

引用

workshop on Principles of Advanced and distributed simulation (PADS)

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

ISBN: (纸本)076951104X

One of the six categories of management services provided in the Run Time Infrastructure (RTI) to federated simulations is time management. Currently, it provides only two message ordering policies, that is, time stamp ordering and receipt ordering. Temporal anomalies occurring during the execution of federation due to the heterogeneous latencies in the communication network are not handled in receipt ordering. While time stamp ordering eliminates the temporal anomalies entirely, it incurs great communication latency, and huge bandwidth requirement. The paper presents a novel time management mechanism which provides a less costly message ordering service, namely causal ordering, to federates. It does not require the specification of lookahead and allows federates that do not require stringent message ordering properties to achieve much more efficient execution. A series of experiments has been carried out to benchmark the performance of this new time management mechanism and the results show that it includes a slight overhead compared to the receipt ordering mechanism but achieves significant performance improvement over the time stamp ordering mechanism.

关键词： Delay Computational modeling Technology management Engineering management Bandwidth Computer simulation Communication networks Runtime Large-scale systems Communication system control

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of an integrated instrumentation system

Performance evaluation of an integrated instrumentation syst...

引用

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

作者： A. Waheed D.T. Rover Department of Electrical Engineering Michigan State University East Lansing MI USA

With increasing sophistication of parallel tool development technologies, runtime data collection and management activities are receiving greater attention from tool developers. We define an instrumentation system (IS) as a set of modules and functions that collect runtime data from concurrent processes and support an integrated tool environment by sharing this data along with specific control information. Presently, it is not standard practice to formally evaluate the performance and functionality of a tool early in its development. Usability and efficiency studies of prototypical tools are emerging to alleviate this situation. However; the underlying IS is removed from the end-user and is part of system infrastructure, thus necessitating more rigorous evaluation. We are developing a structured approach to plan, design, model, realize, and test an IS, called the Vista IS, to appropriately address these issues.

关键词： Instruments Prototypes Runtime Technology management System testing Standards development Usability distributed computing Real time systems Engineering management

来源：评论

学校读者我要写书评

暂无评论

Dag consistent parallel simulation: a predictable and robust conservative algorithm 97

Dag consistent parallel simulation: a predictable and robust...

引用

proceedings of the eleventh workshop on parallel and distributed simulation

作者： Wentong Cai Emmanuelle Letertre Stephen J. Turner School of Applied Science Nanyang Technological University Singapore 639798 IFSIC Universié de Rennes I Campus de Beaulieu 35042 Rennes Cedex France and Dept. of Computer Science University of Exeter Exeter EX4 4PT U.K. Dept. of Computer Science University of Exeter Exeter EX4 4PT U.K.

ISBN: (纸本)9780818679650

We present a novel approach to parallel discrete event simulation based on the Cilk model of multithreaded computation. Cilk's runtime system not only manages the low-level aspects of program execution, but also provides the user with an algorithmic model of performance which can be used to predict the execution time of a parallel simulation. Moreover, a Cilk application can ``scale down'' to run on a single processor with nearly the same performance as that of serial code.A conservative parallel discrete event simulation algorithm has been developed in which communication between logical processes is achieved using Cilk's virtual memory model, dag consistent shared memory. The simulation executes in cycles, where each cycle involves a divide and conquer computation. Although local lookahead information can be exploited, the algorithm is robust in that it also calculates a global simulation time for each cycle. It can therefore be used for applications where zero lookahead may occur.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Causality representation and cancellation mechanism in time warp simulations

Causality representation and cancellation mechanism in time ...

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： M. Chetlur P.A. Wilsey Department of ECECS Experimental Computing Laboratory Cincinnati OH USA

ISBN: (纸本)076951104X

The Time Warp synchronization protocol allows causality errors and then recovers from them with the assistance of a cancellation mechanism. Cancellation can cause the rollback of several other simulation objects that may trigger a cascading rollback situation where the rollback cycles back to the original simulation object. These cycles of rollback can cause the simulation to enter an unstable (or thrashing) state where little real forward simulation progress is achieved. To address this problem, knowledge of causal relations between events can be used during cancellation to avoid cascading rollbacks and to initiate early recovery operations from causality errors. In this paper we describe a logical time representation for Time Warp simulations that is used to disseminate causality information. The new timestamp representation, called Total Clocks, has two components: (i) a virtual time component, and (ii) a vector of event counters similar to Vector clocks. The virtual time component provides a one dimensional global simulation time and the vector of event counters records event processing rates by the simulation objects. This time representation allows us to disseminate causality information during event execution that can be used to allow early recovery, during cancellation. We propose a cancellation mechanism using Total Clocks that allows cascading rollbacks in Time Warp simulations that have FIFO communication channels.

关键词： Time warp simulation Clocks Computational modeling Synchronization Counting circuits Discrete event simulation Laboratories Protocols Acceleration

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共118页 << < 109 110 111 112 113 114 115 116 117 118 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：