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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

661 篇 工学
- 620 篇 计算机科学与技术...
- 359 篇 软件工程
- 84 篇 信息与通信工程
- 79 篇 控制科学与工程
- 72 篇 电气工程
- 47 篇 电子科学与技术（可...
- 10 篇 化学工程与技术
- 7 篇 力学（可授工学、理...
- 7 篇 机械工程
- 7 篇 材料科学与工程（可...
- 7 篇 土木工程
- 6 篇 仪器科学与技术
- 6 篇 动力工程及工程热...
- 6 篇 建筑学
- 6 篇 生物医学工程（可授...
- 6 篇 生物工程
- 5 篇 网络空间安全
- 4 篇 交通运输工程
192 篇 理学
- 145 篇 数学
- 43 篇 系统科学
- 40 篇 统计学（可授理学、...
- 20 篇 物理学
- 13 篇 化学
- 10 篇 生物学
41 篇 管理学
- 35 篇 管理科学与工程(可...
- 23 篇 工商管理
- 8 篇 图书情报与档案管...
8 篇 经济学
- 8 篇 应用经济学
8 篇 教育学
- 8 篇 教育学
4 篇 法学
- 4 篇 社会学
4 篇 医学
4 篇 军事学
1 篇 农学

主题

279 篇 computational mo...
238 篇 computer simulat...
220 篇 discrete event s...
135 篇 concurrent compu...
106 篇 distributed comp...
94 篇 computer science
85 篇 parallel process...
74 篇 protocols
67 篇 computer archite...
62 篇 analytical model...
62 篇 computer network...
57 篇 costs
56 篇 large-scale syst...
54 篇 application soft...
54 篇 time warp simula...
48 篇 hardware
46 篇 delay
43 篇 parallel process...
42 篇 predictive model...
41 篇 circuit simulati...

机构

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...
7 篇 univ roma la sap...
7 篇 computer science...
6 篇 coll of william ...
6 篇 school of comput...
6 篇 department of co...
6 篇 georgia inst of ...
6 篇 georgia institut...
5 篇 gintic institute...
5 篇 rensselaer polyt...
5 篇 school of applie...
4 篇 mitre corporatio...
4 篇 georgia inst of ...
4 篇 department of el...

作者

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

语言

1,347 篇 英文
7 篇 俄文
5 篇 中文
1 篇 其他

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

共 1360 条记录，以下是1311-1320 订阅

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

详细简洁

排序：

Effective values: an approach for characterizing dependability parameters

Effective values: an approach for characterizing dependabili...

引用

International Conference and workshop on Engineering of Computer-Based Systems

作者： S. Noureddine A. Lehmann Department of Computer Engineering University of Federal Armed Forces Munich Germany

ISBN: (纸本)0769510868

The authors discuss a novel direction for evaluating system dependability. The research efforts outlined are part of a special focus concerning the dependability of complex distributed systems at the Department of Computer Engineering of the Federal Armed Forces University in Munich, Germany. Our approach emphasizes the behavior of components after they have been embedded in a system. We use the notion of effective values for the analysis and estimation of key dependability parameters. The concept is targeted to unify performance characterization with the dependability. Besides analysis, we report on some simulation results, which were in favor of our assumptions.

关键词： Hardware Application software Availability distributed computing Computer applications Computer science Military computing Concurrent computing parallel algorithms Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Combining periodic and probabilistic checkpointing in optimistic simulation 99

Combining periodic and probabilistic checkpointing in optimi...

引用

proceedings of the thirteenth workshop on parallel and distributed simulation

作者： Francesco Quaglia Dipartimento di Informatica e Sistemistica Università di Roma "La Sapienza" Via Salaria 113 00198 Roma Italy

ISBN: (纸本)9780769501550

This paper presents a checkpointing scheme for optimistic simulation which is a mixed approach between periodic and probabilistic checkpointing. The latter, basing on statistical data collected during the simulation, aims at recording as checkpoints states of a logical process that have high probability to be restored due to rollback (this is done in order to make those states immediately available). The periodic part prevents performance degradation due to state reconstruction (coasting forward) cost whenever the collected statistics do not allow to identify states highly likely to be ***, this scheme can be seen as a highly general solution to tackle the checkpoint problem in optimistic simulation. A performance comparison with previous solutions is carried out through a simulation study of a store-and-forward communication network in a two-dimensional torus topology.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CHIUW 2020 The seventh Annual Chapel Implementers and Users workshop

CHIUW 2020 The Seventh Annual Chapel Implementers and Users ...

引用

IEEE International Symposium on parallel and distributed Processing workshops and Phd Forum (IPDPSW)

作者： Brad Chamberlain

ISBN: (数字)9781728174457

ISBN: (纸本)9781728174570

The Chapel Implementers and Users workshop (CHIUW) is the primary annual gathering of the Chapel community. Its main goal is to bring developers and users of Chapel together on an regular basis to share progress and results with one another and with members of the broader parallel programming community. CHIUW typically also fosters new Chapel collaborations and endeavors through a code camp session held on the following day. Anyone with interest in Chapel is encouraged to attend CHIUW, from the seasoned user or developer to someone simply curious to learn more. This year, due to the COVID-19 pandemic, we are holding CHIUW in an online fom1at. This year, CHIUW received 13 submissions from 12 1ead authors, two of which were full research papers while the other 11 were extended abstracts. Each submitted extended abstract received four reviews from the program committee, while the research papers received 5-6. Due to our goal of making CHIUW as inclusive as possible, we ended up accepting eight of the submissions (including both papers) as full- length talks and tour as short talks (pending author interest), rejecting only one of the two submissions by the same lead author. After being accepted, one of the submissions upgraded from an extended abstract to a short paper with the program committee's approval. The accepted submissions can be found within these proceedings and describe recent work being done in improving Chapel's features, optimizing its performance, and using Chapel to target GPUs, as well as a variety of applications being pursued in Chapel including Computational Fluid Dynamics, graph algorithms such as Hypergraph Homology, and simulations of Ultralight Dark Matter.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient massively parallel simulation of dynamic channel assignment schemes for wireless cellular communications

Efficient massively parallel simulation of dynamic channel a...

引用

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

作者： A.G. Greenberg B.D. Lubachevsky P.E. Wright D.M. Nicol AT and T Bell Laboratories Inc. USA College of William and Mary USA

Fast, efficient parallel algorithms are presented for discrete event simulations of dynamic channel assignment schemes for wireless cellular communication networks. The driving events are call arrivals and departures, in continuous time, to cells geographically distributed across the service area. A dynamic channel assignment scheme decides which call arrivals to accept, and which channels to allocate to the accepted calls, attempting to minimize call blocking while ensuring co-channel interference is tolerably low. Specifically, the scheme ensures that the same channel is used concurrently at different cells only if the pairwise distances between those cells are sufficiently large. Much of the complexity of the system comes from ensuring this separation. The network is modeled as a system of interacting continuous time automata, each corresponding to a cell. To simulate the model, we use conservative methods; i.e., methods in which no errors occur in the course of the simulation and so no rollback or relaxation is needed. Implemented on a 16 K processor MasPar MP-1, an elegant and simple technique provides speedups of about 15/spl times/ over an optimized serial simulation running on a high speed workstation. A drawback of this technique, typical of conservative methods, is that processor utilization is rather low. To overcome this, we developed new methods that exploit slackness in event dependencies over short intervals of time, thereby raising the utilization to above 50% and the speedup over the optimized serial code to about 120/spl times/ with respect to the workstation simulation.< >

关键词： Discrete event simulation Resource management Cellular networks Workstations Wireless communication Automata Land mobile radio cellular systems Educational institutions parallel algorithms Communication networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Experiments in automated load balancing 96

Experiments in automated load balancing

引用

proceedings of the tenth workshop on parallel and distributed simulation

作者： Linda F. Wilson David M. Nicol Institute for Computer Applications Science and Engineering NASA Langley Research Center Hampton VA Department of Computer Science The College of William and Mary P.O. Box 8795 Williamsburg VA

ISBN: (纸本)9780818675393

One of the promises of parallelized discrete-event simulation is that it might provide significant speedups over sequential simulation. In reality, high performance cannot be achieved unless the system is fine-tuned to balance computation, communication, and synchronization requirements. In this paper, we discuss our experiments in automated load balancing using the SPEEDES simulation framework. Specifically, we examine three mapping algorithms that use run-time measurements. Using simulation models of queuing networks and the National Airspace System, we investigate (i) the use of run-time data to guide mapping, (ii) the utility of considering communication costs in a mapping algorithm, (iii) the degree to which computational ``hot-spots'' ought to be broken up in the linearization, and (iv) the relative execution costs of the different algorithms. We compare the performance of the three algorithms using results from the Intel Paragon.

关键词： load balancing discrete-event simulation parallel computing performance analysis

来源：评论

学校读者我要写书评

暂无评论

Hierarchical strategy of model partitioning for VLSI-design using an improved mixture of experts approach 96

Hierarchical strategy of model partitioning for VLSI-design ...

引用

proceedings of the tenth workshop on parallel and distributed simulation

作者： K. Hering R. Haupt Th. Villmann Universität Leipzig Inst. für Informatik Augustusplatz 10/11 04109 Leipzig Germany Inst. für Techno- und Wirtschaftsmathematik E.-Schrödinger-Str. Geb. 48/575 67663 Kaiserslautern Germany

ISBN: (纸本)9780818675393

The partitioning of complex processor models on the gate and register-transfer level for parallel functional simulation based on the clock-cycle algorithm is considered. We introduce a hierarchical partitioning scheme combining various partitioning algorithms in the frame of a competing strategy. Melting together different partitioning results within one level using superpositions we crossover to a mixture of experts one. This approach is improved applying genetic algorithms. In addition we present two new partitioning algorithms both of them taking cones as fundamental units for building partitions.

关键词： Logic simulation VLSI-Design Genetic Algorithms Partitioning

来源：评论

学校读者我要写书评

暂无评论

distributed motion planning for modular robots with unit-compressible modules

Distributed motion planning for modular robots with unit-com...

引用

IEEE International workshop on Intelligent Robots and Systems (IROS)

作者： Z. Butler S. Byrnes D. Rus Department of Computer Science Dartmouth College USA

The ability of self-reconfigurable robots to solve a variety of robot tasks comes in part from their use of a large number of modules. Effective use of these systems requires parallel actuation and planning, both for efficiency and independence from a central controller. This paper presents the PacMan algorithm, a technique for distributed actuation and planning. This algorithm was developed for systems with unit-compressible modules, such as the crystalline robot. We also describe some analytical properties of the PacMan planning and actuation, and discuss simulation and hardware experiments.

关键词： Motion planning Centralized control Crystallization Control systems parallel robots Legged locomotion Robotics and automation Shape control Computer science Educational institutions

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Empirical study of parallel trace-driven LRU cache simulators 95

Empirical study of parallel trace-driven LRU cache simulator...

引用

proceedings of the ninth workshop on parallel and distributed simulation

作者： David Nicol Eric Carr Department of Computer Science College of William and Mary Williamsburg VA Department of Math and Computer Science Carleton College Northfield MN

ISBN: (纸本)9780818671203

This paper reports on the performance of four parallel algorithms for simulating an associative cache operating under the LRU (Least-Recently-Used) replacement policy. Three of the algorithms are implemented on the MasPar MP-2. Another algorithm is a parallelization of an efficient serial algorithm on the Intel Paragon. We assess the strengths and weaknesses of these algorithms as a function of problem size and characteristics, and compare their performance on traces derived from execution of three SPEC92 benchmark programs.

关键词： associative cache content-addressable storage storage management cache storage parallel algorithms SPEC92 benchmark programs parallel trace-driven LRU cache simulators Least-Recently-Used replacement policy Intel Paragon efficient serial algorithm MasPar MP-2 virtual machines

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共136页 << < 127 128 129 130 131 132 133 134 135 136 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：