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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,437 篇 会议
108 篇 期刊文献
3 册 图书

馆藏范围

3,548 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,425 篇 工学
- 2,335 篇 计算机科学与技术...
- 1,551 篇 软件工程
- 465 篇 信息与通信工程
- 335 篇 电气工程
- 252 篇 控制科学与工程
- 185 篇 网络空间安全
- 179 篇 电子科学与技术（可...
- 41 篇 生物医学工程（可授...
- 34 篇 动力工程及工程热...
- 29 篇 机械工程
- 29 篇 建筑学
- 29 篇 生物工程
- 28 篇 安全科学与工程
- 25 篇 土木工程
- 23 篇 光学工程
- 22 篇 力学（可授工学、理...
- 20 篇 化学工程与技术
- 20 篇 交通运输工程
- 17 篇 环境科学与工程（可...
1,069 篇 理学
- 949 篇 数学
- 131 篇 统计学（可授理学、...
- 80 篇 系统科学
- 77 篇 物理学
- 37 篇 生物学
- 26 篇 化学
462 篇 管理学
- 363 篇 管理科学与工程(可...
- 231 篇 工商管理
- 123 篇 图书情报与档案管...
43 篇 经济学
- 43 篇 应用经济学
21 篇 法学
- 21 篇 社会学
15 篇 农学
14 篇 医学
11 篇 教育学
3 篇 文学
1 篇 军事学

主题

490 篇 parallel process...
381 篇 parallel process...
313 篇 concurrent compu...
294 篇 computer science
276 篇 distributed comp...
266 篇 distributed comp...
217 篇 parallel algorit...
163 篇 computer archite...
162 篇 application soft...
132 篇 computational mo...
130 篇 parallel program...
121 篇 costs
118 篇 hardware
110 篇 algorithm design...
110 篇 computer network...
108 篇 delay
107 篇 processor schedu...
88 篇 distributed proc...
84 篇 parallel archite...
78 篇 hypercubes

机构

13 篇 pacific northwes...
11 篇 ieee
9 篇 syracuse univ sy...
9 篇 georgia inst of ...
9 篇 department of co...
8 篇 new jersey inst ...
7 篇 ibm thomas j. wa...
7 篇 school of comput...
7 篇 purdue univ west...
7 篇 irisa rennes
6 篇 texas a&m univ c...
6 篇 univ of californ...
6 篇 michigan state u...
6 篇 univ of maryland...
6 篇 institute of com...
6 篇 ohio state univ ...
6 篇 carnegie mellon ...
5 篇 department of co...
5 篇 department of co...
5 篇 university of lu...

作者

14 篇 bader david a.
10 篇 li keqin
9 篇 zomaya albert y.
9 篇 prasanna viktor ...
9 篇 das sajal k.
8 篇 prasad sushil k.
8 篇 maciejewski anth...
8 篇 sussman alan
8 篇 sun xian-he
7 篇 ibarra oscar h.
7 篇 boukerche azzedi...
7 篇 casanova henri
7 篇 talbi el-ghazali
7 篇 panda dhabaleswa...
7 篇 olariu s.
7 篇 cai wentong
7 篇 ahmad ishfaq
7 篇 aluru srinivas
6 篇 pan yi
6 篇 dongarra jack

语言

3,527 篇 英文
20 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing"

共 3548 条记录，以下是1131-1140 订阅

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

详细简洁

排序：

Towards a framework for scalable model checking of concurrent C programs

Towards a framework for scalable model checking of concurren...

引用

2nd International symposium on Leveraging Applications of Formal Methods, Verification and Validation, ISoLA 2006

作者： Ji, Wang Yi, Xiaodong Yang, Xuejun National Laboratory for Parallel and Distributed Processing Changsha China

ISBN: (纸本)0769530710

The paper presents a novel framework for scalable model checking of concurrent C programs. With the idea of verification reuse, it shows an integrated approach to efficient reduction of state space by abstraction, symbolic representation and dynamic partial-order reduction (DPOR) techniques. The framework is founded on an over-approximated model of the concurrent program by variable abstraction, and combines DPOR with lightweight symbolic execution to generate the symbolic conditions for all locations, called α-conditions, which are intended for verification reuse. The α-conditions of a location are weak approximation of the conditions that must be satisfied at that location so as to guarantee the temporal safety properties to be verified. These conditions will be checked for reusing the previous exploration in verification, and will be iteratively refined under the guidance of spurious counterexamples. The presented framework is demonstrated by several experiments including a concurrent software system whose server and client processes are derived from openssl-0.9.6c C source codes implementing the SSL protocol. © 2007 ieee.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

A strategy proof mechanism for scheduling divisible loads in bus networks without control processors 06

A strategy proof mechanism for scheduling divisible loads in...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： T.E. Carroll D. Grosu Department of Computer Science Wayne State University Detroit MI USA

ISBN: (纸本)9781424400546

Divisible load theory (DLT) considers the scheduling of arbitrarily partitionable loads in distributed systems. The underlying assumption of DLT is that the processors are obedient (i.e., they do not "cheat" the protocol), which is unrealistic when the processors are owned by autonomous, self-interested organizations that have no a priori motivation for cooperation and which strive to maximize their own welfare. In this scenario, they will manipulate the algorithm if it is beneficial to do so. In this paper, we propose a strategy proof mechanism for scheduling divisible loads in bus networks without control processors. We augment DLT with incentives so that it is to the benefit of a processor to truthfully report its processing capacity and to process its assignment at full capacity. The mechanism provides incentives to processors for reporting deviants and issues fines to deviants, which results in abated willingness to deviate

关键词： Intelligent networks Processor scheduling Computer science Multimedia databases Scheduling algorithm parallel processing Image processing Image databases Visual databases Linear algebra

来源：评论

学校读者我要写书评

暂无评论

Optimal map construction of an unknown torus 06

Optimal map construction of an unknown torus

引用

International symposium on parallel and distributed processing (IPDPS)

作者： H. Becha P. Flocchini School of Information Technology and Engineering University of Ottawa Canada

ISBN: (纸本)9781424400546

In this paper we consider the map construction problem in the case of an anonymous, unoriented torus of unknown size. An agent that can move from node to neighbouring node in the torus is initially placed in an arbitrary node and has to construct an edge-labeled map. In other words, it has to draw in its local memory an edge-labeled torus isomorphic to the one it is moving on. The agent has enough local memory to represent the torus and one or two tokens that can be dropped on and picked up from nodes. Efficiency is measured in terms of number of moves performed by the agent. When the agent has no token available, the problem is clearly unsolvable. In the paper we show that, when the agent has one token available there exists an optimal algorithm for constructing the map of the torus; the agent, in fact, performs Theta(N) moves (where N is the number of nodes of the torus). Before showing the optimal solution with the optimal number of tokens, we describe a simpler solution that works when two tokens are available, we then modify it to obtain the same bound when the agent has only one token available

关键词： Tree graphs Algorithm design and analysis Information technology Performance evaluation Mobile agents distributed algorithms Network topology Costs Message passing Labeling

来源：评论

学校读者我要写书评

暂无评论

An adaptive dynamic grid-based approach to data distribution management

An adaptive dynamic grid-based approach to data distribution...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： A. Boukerche YunFeng Gu R.B. Araujo PARADISE Research Laboratory University of Ottawa Canada Federal University of Sāo Carlos UFSCar Brazil

This paper presents a novel adaptive dynamic grid-based data distribution management (DDM) scheme, which we refer to as ADGB. The main objective of our protocol is to optimize DDM time through matching probability (MP) and federates' performance. A distribution rate (DR) along with MP are used as part of the ADGB method to select, throughout the simulation, from different devised advertisement schemes, the best scheme to achieve maximum gain with acceptable network traffic overhead. As opposed to previous protocols, the novelty of our ADGB scheme is its focus on improving overall performance, an important goal for DDM strategy. In this paper, we present our scheme and highlight its performance analysis

关键词： distributed decision making Optimization methods Innovation management Technological innovation Engineering profession Performance analysis Delay effects Propagation delay Subscriptions Laboratories

来源：评论

学校读者我要写书评

暂无评论

Applying single processor algorithms to schedule tasks on reconfigurable devices respecting reconfiguration times 06

Applying single processor algorithms to schedule tasks on re...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： F. Dittmann M. Gotz Heinz Nixdorf Institute University of Paderborn Paderborn Germany

ISBN: (纸本)9781424400546

In the single machine environment, several scheduling algorithms exist that allow to quantify schedules with respect to feasibility, optimality, etc. In contrast, reconfigurable devices execute tasks in parallel, which intentionally collides with the single machine principle and seems to require new methods and evaluation strategies for scheduling. However, the reconfiguration phases of adaptable architectures usually take place sequentially. Run-time adaptation is realized using an exclusive port, which is occupied for some reasonable time during reconfiguration. Thus, we can find an analogy to the single machine environment. In this paper, we investigate the appliance of single processor scheduling algorithms to task reconfiguration on reconfigurable systems. We determine necessary adaptations and propose methods to evaluate the scheduling algorithms.

关键词： Scheduling algorithm Processor scheduling Single machine scheduling Home appliances Runtime environment Computer architecture parallel processing System-on-a-chip Real time systems Testing

来源：评论

学校读者我要写书评

暂无评论

Plan switching: an approach to plan execution in changing environments 06

Plan switching: an approach to plan execution in changing en...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： Han Yu D.C. Marinescu A.S. Wu H.J. Siegel R.A. Daley I-Jeng Wang School of Electrical Engineering and Computer Science University of Central Florida Orlando FL USA Department of Electrical and Computer Engineering and Department of Computer Science Colorado State University Fort Collins CO USA Applied Physics Laboratory Johns Hopkins UniversitY Laurel MD USA

ISBN: (纸本)9781424400546

The execution of a complex task in any environment requires planning. Planning is the process of constructing an activity graph given by the current state of the system, a goal state, and a set of activities. If we wish to execute a complex computing task in a heterogeneous computing environment with autonomous resource providers, we should be able to adapt to changes in the environment. A possible solution is to construct a family of activity graphs beforehand and investigate the means of switching from one member of the family to another when the execution of one activity graph fails. In this paper, we study the conditions when plan switching is feasible. Then we introduce an approach for plan switching and report the simulation results of this approach

关键词： Computer science Computational modeling Real time systems Physics Process planning Large-scale systems distributed computing Availability Uncertainty Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Software-based fault-tolerant routing algorithm in multidimensional networks 06

Software-based fault-tolerant routing algorithm in multidime...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： F. Safaei M. Rezazad A. Khonsari M. Fathy M. Ould-Khaoua N. Alzeidi Department of Computer Engineering Iran University of Science and Technology Tehran Iran IPM School of Computer Science Tehran Iran Department of Electrical and Computer Engineering University of Tehran Tehran Iran Department of Computing Science University of Glasgow UK

ISBN: (纸本)9781424400546

Massively parallel computing systems are being built with hundreds or thousands of components such as nodes, links, memories, and connectors. The failure of a component in such systems will not only reduce the computational power but also alter the network's topology. The software-based fault-tolerant routing algorithm is a popular routing to achieve fault-tolerance capability in networks. This algorithm is initially proposed only for two dimensional networks (Suh et al., 2000). Since, higher dimensional networks have been widely employed in many contemporary massively parallel systems; this paper proposes an approach to extend this routing scheme to these indispensable higher dimensional networks. Deadlock and livelock freedom and the performance of presented algorithm, have been investigated for networks with different dimensionality and various fault regions. Furthermore, performance results have been presented through simulation experiments

关键词： Fault tolerance Routing Intelligent networks Power engineering computing Concurrent computing Connectors Network topology Computational modeling Computer science parallel processing

来源：评论

学校读者我要写书评

暂无评论

Tree-based overlay networks for scalable applications 06

Tree-based overlay networks for scalable applications

引用

International symposium on parallel and distributed processing (IPDPS)

作者： D.C. Arnold G.D. Pack B.P. Miller Computer Sciences Department University of Wisconsin Madison WI USA

ISBN: (纸本)9781424400546

The increasing availability of high-performance computing systems with thousands, tens of thousands, and even hundreds of thousands of computational nodes is driving the demand for programming models and infrastructures that allow effective use of such large-scale environments. Tree-based overlay networks (TBO~Ns) have proven to provide such a model for distributed tools like performance profilers, parallel debuggers, system monitors and system administration tools. We demonstrate that the extensibility and flexibility of the TBO~N distributed computing model, along with its performance characteristics, make it surprisingly general, particularly for applications outside the tool domain. We describe many interesting applications and commonly-used algorithms for which TBO~Ns are well-suited and provide a new (non-tool) case study, a distributed implementation of the mean-shift algorithm commonly used in computer vision to delineate arbitrarily shaped clusters in complex, multi-modal feature spaces.

关键词： Clustering algorithms Scalability distributed computing Application software Data communication Availability Large-scale systems Computer vision Communication system control Data analysis

来源：评论

学校读者我要写书评

暂无评论

parallel implementation of the replica exchange molecular dynamics algorithm on Blue Gene/L 06

Parallel implementation of the replica exchange molecular dy...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： M. Eleftheriou A. Rayshubski J.W. Pitera B.G. Fitch R. Zhou R.S. Germain IBM Thomas J. Watson Research Center Yorktown Heights NY USA IBM Almaden Research Center Saint Jose CA USA

ISBN: (纸本)9781424400546

The replica exchange method is a popular approach for studying the folding thermodynamics of small to modest size proteins in explicit solvent, since it is easily parallelized. However, replica exchange can become computationally expensive for large-scale studies, due to the number of replicas needed as well as interprocess or communication requirements both between and within replicas. In this paper, we discuss an implementation of replica exchange molecular dynamics on Blue Gene/L for performing large scale simulation studies of systems of biological interest. The algorithm is tuned with an awareness of the physical network topology and hardware performance features of the Blue Gene/L architecture. Performance measurements for replica exchange using the blue matter molecular dynamics application are presented on Blue Gene/L hardware with up to 256 replicas simulated on 8,192 compute nodes. Both scalability and performance are achieved with this implementation.

关键词： Heuristic algorithms Large-scale systems Biological system modeling Computational modeling Hardware Thermodynamics Proteins Solvents Biology computing Network topology

来源：评论

学校读者我要写书评

暂无评论

Sim-X: parallel system software for interactive multi-experiment computational studies 06

Sim-X: parallel system software for interactive multi-experi...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： Siu-Man Yau E. Grinspun V. Karamcheti D. Zorin Courant Institute of Mathematical Sciences New York University USA Department of Computer Science Columbia University USA

ISBN: (纸本)9781424400546

Advances in high-performance computing have led to the broad use of computational studies in everyday engineering and scientific applications. A single study may require thousands of computational experiments, each corresponding to individual runs of simulation software with different parameter settings; in complex studies, the pattern of parameter changes is complex and may have to be adjusted by the user based on partial simulation results. Unfortunately, existing tools have limited high-level support for managing large ensembles of simultaneous computational experiments. In this paper, we present a system architecture for interactive computational studies targeting two goals. The first is to provide a framework for high-level user interaction with computational studies, rather than individual experiments; the second is to maximize the size of the studies that can be performed at close to interactive rates. We describe a prototype implementation of the system and demonstrate performance improvements obtained using our approach for a simple model problem

关键词： System software Concurrent computing Computational modeling High performance computing Grid computing Application software Computer architecture Computer science Software prototyping Virtual prototyping

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：