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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

829 篇 会议
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

669 篇 工学
- 634 篇 计算机科学与技术...
- 299 篇 软件工程
- 107 篇 信息与通信工程
- 95 篇 电气工程
- 49 篇 控制科学与工程
- 32 篇 电子科学与技术（可...
- 11 篇 机械工程
- 7 篇 生物医学工程（可授...
- 6 篇 仪器科学与技术
- 5 篇 动力工程及工程热...
- 4 篇 建筑学
- 4 篇 生物工程
- 3 篇 力学（可授工学、理...
- 3 篇 冶金工程
- 3 篇 土木工程
- 3 篇 网络空间安全
155 篇 理学
- 132 篇 数学
- 20 篇 统计学（可授理学、...
- 16 篇 物理学
- 10 篇 系统科学
- 5 篇 化学
- 4 篇 生物学
52 篇 管理学
- 46 篇 管理科学与工程(可...
- 17 篇 工商管理
- 10 篇 图书情报与档案管...
8 篇 医学
- 5 篇 临床医学
- 3 篇 特种医学
5 篇 法学
- 4 篇 社会学
- 2 篇 法学
3 篇 经济学
- 3 篇 应用经济学
1 篇 教育学
1 篇 农学
1 篇 军事学

主题

170 篇 parallel process...
77 篇 parallel process...
55 篇 concurrent compu...
43 篇 distributed comp...
42 篇 computer science
41 篇 distributed comp...
36 篇 parallel algorit...
32 篇 computer archite...
29 篇 hardware
28 篇 application soft...
28 篇 computational mo...
24 篇 costs
24 篇 algorithm design...
23 篇 parallel program...
23 篇 delay
19 篇 processor schedu...
18 篇 parallel archite...
18 篇 computer network...
16 篇 partitioning alg...
15 篇 high performance...

机构

5 篇 natl univ def te...
4 篇 univ of central ...
3 篇 oak ridge natl l...
3 篇 california inst ...
3 篇 syracuse univ sy...
3 篇 beijing univ pos...
3 篇 new jersey inst ...
3 篇 inner mongolia u...
3 篇 univ of maryland...
3 篇 univ of illinois...
3 篇 ohio state univ ...
3 篇 natl univ def te...
2 篇 natl univ def te...
2 篇 college of compu...
2 篇 univ texas austi...
2 篇 natl univ irelan...
2 篇 washington state...
2 篇 concordia univ m...
2 篇 lipn
2 篇 school of comput...

作者

4 篇 kale laxmikant v...
4 篇 prasanna viktor ...
4 篇 rothermel kurt
3 篇 yuxing peng
3 篇 yao wenbin
3 篇 mi haibo
3 篇 haibo mi
3 篇 mcloone s
3 篇 liu jie
3 篇 sohn andrew
3 篇 wang yijie
3 篇 tang yuxing
3 篇 ward t
3 篇 boukerche a
3 篇 sato mitsuhisa
3 篇 das sajal k.
3 篇 li xiaoyong
3 篇 siegel howard ja...
3 篇 delaney d
2 篇 boku taisuke

语言

831 篇 英文
3 篇 其他
1 篇 中文

检索条件"任意字段=8th IEEE Symposium on Parallel and Distributed Processing"

共 835 条记录，以下是711-720 订阅

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

详细简洁

排序：

An optimal parallel matching algorithm for a convex bipartite graph on a mesh-connected computer

An optimal parallel matching algorithm for a convex bipartit...

引用

International symposium on parallel processing

作者： Myung-Ho Kim Chang-Sung Jeong Myung-Soo Kim Department of Computer Science Postech Pohang Gyeongbuk South Korea Department of Electronics Engineering Korea University Seoul South Korea

We address the problem of finding a maximum matching for a convex bipartite graph on a mesh-connected computer (MCC). We show that this can be done in optimal time on MCC by designing the efficient merge and division ... 详细信息

ISBN: (纸本)0818656026

关键词： Bipartite graph Concurrent computing parallel algorithms distributed computing Solid modeling Algorithm design and analysis Partitioning algorithms Computer science Sorting Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

PORTS: A parallel, optimistic, real-time simulator 94

PORTS: A parallel, optimistic, real-time simulator

引用

Proceedings of the 8th Workshop on parallel and distributed Simulation

作者： Ghosh, Kaushik Panesar, Kiran Fujimoto, Richard M. Schwan, Karsten Georgia Institute of Technology Atlanta

ISBN: (纸本)9781565550278

this paper describes issues concerning the design of an optimistic parallel discrete event simulation system that executes in environments that impose real-time constraints on the simulator's execution. Two key problems must be addressed by such a system. First the timing characteristics of the parallel simulator must be sufficiently predictable to allow one to guarantee that real-time deadlines for completing simulation computations will be met. Second, the optimistic computation must be able to interact with its surrounding environment with as little latency as possible, necessitating rapid commitment of I/O *** address the first question, we show that optimistic simulators that never send incorrect messages (sometimes called “aggressive-no-risk” simulators) provide sufficient predictability to allow traditional schedulability analysis techniques commonly used in real-time systems to be applied. We show that incremental state saving techniques introduce sufficient unpredictability that they are not well-suited for real-time environments. We observe that the traditional “lowest timestamp first” scheduling policy used in many optimistic parallel simulation systems is an optimal (in the real-time sense) scheduling algorithm when event timestamps and real-time deadlines are the same. Finally, to address the question for rapid commitment of I/O operations, we utilize a continuous GVT computation scheme for shared-memory multiprocessors where a new value of GVT is computed after processing each event in the *** ideas are incorporated in a parallel, optimistic, real-time simulation system called PORTS. Initial performance measurements of the shared-memory based PORTS system executing on a Kendall Square Research multiprocessor are presented. Initial performance results are encouraging, demonstrating that PORTS achieves performance approaching that of a conventional Time Warp system for the benchmark programs that were tested.

关键词： Simulators

来源：评论

学校读者我要写书评

暂无评论

PermaDAQ: A Scientific Instrument for Precision Sensing and Data Recovery in Environmental Extremes

PermaDAQ: A Scientific Instrument for Precision Sensing and ...

引用

8th International symposium on Information processing Sensor Networks

作者： Beutel, Jan Gruber, Stephan Hasler, Andreas Lim, Roman Meier, Andreas Plessl, Christian Talzi, Igor thiele, Lothar Tschudin, Christian Woehrle, Matthias Yuecel, Mustafa ETH Comp Engn & Networks Lab Zurich Switzerland Univ Zurich Phys Geography Div Dept Geophys Zurich Switzerland Univ Paderborn Paderborn Ctr Parallel Comp Paderborn Germany Univ Basel Dept Comp Sci Basel Switzerland

ISBN: (纸本)9781424451081

the PermaSense project has set the ambitious goal of gathering real-time environmental data for high-mountain permafrost in unattended operation over multiple years. this paper discusses the specialized sensing and data recovery architecture tailored to meet the precision, reliability and durability requirements of scientists utilizing the data for model validation. We present a custom sensor interface board including specialized sensors and redundancy features for end-to-end data validation. Aspects of high-quality data acquisition, design for reliability by strict separation of operating phases and analysis of energy efficiency are discussed. the system integration using the Dozer protocol scheme achieves a best-in-class average power consumption of 148 mu A considerably exceeding the lifetime requirement.

关键词： Architecture Data Acquisition Environmental Monitoring Wireless Sensor Networks Low-Power

来源：评论

学校读者我要写书评

暂无评论

distributed identification of all maximal incomplete subcubes in a faulty hypercube

Distributed identification of all maximal incomplete subcube...

引用

International symposium on parallel processing

作者： Hsing-Lung Chen Nian-Feng Tzeng Department of Electronic Engineering National Taiwan Institute of Technology Taipei Taiwan Center for Advanced Computer Studies University of Southwestern Louisiana Lafayette LA USA

ISBN: (纸本)0818656026

Reconfiguring a faulty hypercube into a maximal incomplete cube tends to lower potential performance degradation, because a hypercube so reconfigured often results in a much larger system than what is attained by any conventional reconfiguration scheme which identifies only complete subcubes. this paper proposes an efficient strategy for identifying all the maximal incomplete subcubes present in a faulty hypercube. the proposed strategy is distributed in that every healthy node executes the same identification algorithm independently at the same time.< >

关键词： Fault diagnosis Hypercubes Degradation Contracts Performance loss Councils

来源：评论

学校读者我要写书评

暂无评论

Query-based horizontal fragmentation approach for disjunctive deductive databases

Query-based horizontal fragmentation approach for disjunctiv...

引用

Proceedings of the 1997 8th International Workshop on Database and Expert Systems Applications, DEXA'97

作者： Ng, Yiu-Kai Seetheraman, Aparna Brigham Young Univ Provo United States

A disjunctive deductive database (DDDB) is more general than the deductive database model since the former captures more information than the latter. Distributing a DDDB facilitates the splitting of queries of the database into subqueries to enhance query processing since the answers to each subquery are computed only against those portions of the DDDB relevant to the subquery and can be generated in parallel. Evaluating these subqueries thus improves the response time of the system and reduces communication cost involved in evaluating the entire query. Existing literature on DDDBs does not include a well-designed horizontal fragmentation approach. In this paper, we propose a horizontal fragmentation approach for any given DDDB D based on the set of common user queries S of D from which a fragment is produced for each query Q in S. All the rules and ground facts in D required to answer Q are collected into a fragment F, and it is sufficient to evaluate Q against F alone to compute all answers to Q. Hence, the need to process fragments generated by the other queries of D is eliminated, and time and cost of unnecessary processing is saved.

关键词： distributed database systems

来源：评论

学校读者我要写书评

暂无评论

Efficient barriers for distributed shared memory computers

Efficient barriers for distributed shared memory computers

引用

International symposium on parallel processing

作者： D. Grunwald S. Vajracharya Department of Computer Science University of Colorado Boulder CO USA

Barrier algorithms are central to the performance of numerous algorithms on scalable, high-performance architectures. Numerous barrier algorithms have been suggested and studied for non-uniform memory access (NUMA) architectures, but less work has been done for cache only memory access (COMA) or attraction memory architectures such as the KSR-1. We present two new barrier algorithms that offer the best performance we have recorded on the KSR-1 distributed cache multiprocessor. We discuss the trade-offs and the performance of seven algorithms on two architectures. the new barrier algorithms adapt well to a hierarchical caching memory model and take advantage of parallel communication offered by most multiprocessor interconnection networks. Performance results are shown for a 256-processor KSR-1 and a 20-processor Sequent Symmetry.< >

关键词： distributed computing Computer architecture Algorithm design and analysis Memory architecture Hardware distributed control Computer science Multiprocessor interconnection networks Communication networks Communication system control

来源：评论

学校读者我要写书评

暂无评论

the design of scalable software libraries for distributed memory concurrent computers

The design of scalable software libraries for distributed me...

引用

International symposium on parallel processing

作者： Jaeyoung Choi J.J. Dongarra D.W. Walker Mathematical Sciences Section Oak Ridge National Laboratory Oak Ridge TN USA Department of Computer Science University of Tennessee Knoxville TN USA

Describes the design of ScaLAPACK, a scalable software library for performing dense and banded linear algebra computations on distributed memory concurrent computers. the specification of the data distribution has important consequences for interprocessor communication and load balance, and hence is a major factor in determining performance and scalability of the library routines. the block cyclic data distribution is adopted as a simple, yet general purpose, way of decomposing block-partitioned matrices. distributed memory versions of the Level 3 BLAS provide an easy and convenient way of implementing the ScaLAPACK routines.< >

关键词： Software design Software libraries Concurrent computing distributed computing Scalability Linear algebra Large-scale systems High performance computing Lifting equipment Laboratories

来源：评论

学校读者我要写书评

暂无评论

Barrier synchronization techniques for distributed process creation

Barrier synchronization techniques for distributed process c...

引用

International symposium on parallel processing

作者： R. DeMara B. Mortlagh C. Lin S. Kuo Department of Electrical and Computer Engr. University of Central Florida Orlando FL USA University of Central Florida Orlando FL US Dept. of Electr. & Comput. Eng. Univ. of Central Florida Orlando FL USA Department of Electrical Engineering-Systems University of Southern California Los Angeles CA USA

Synchronization techniques are proposed for algorithms which spawn processes remotely on loosely coupled processors based on run-time characteristics. the performance of the proposed synchronization schemes are measured on the iPSC/2 and SNAP-1 multiprocessors and their implementation cost is discussed. Results show that processes created dynamically throughout a distributed system can be synchronized at comparable overhead and cost to that required for fixed-location process creation.< >

关键词： Runtime Costs distributed computing Hypercubes Degradation Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Power supply system of DC/AC micro grid system

Power supply system of DC/AC micro grid system

引用

8th International Conference on Power Electronics - ECCE Asia: "Green World with Power Electronics", ICPE 2011-ECCE Asia

作者： Yukita, K. Ban, K. Goto, Y. Ichiyanagi, K. Hirose, K. Ushirokawa, T. Okui, Y. Takabayashi, H. Aichi Institute of Technology 1247 Yachigusa Yagusa Toyota 470-0392 Japan NTT Facilites Inc G.H.Y. Bldg. 2-13-1 Kitaotsuka Toshima-ku Tokyo 170-0004 Japan SANYO Denki Co. Ltd 812-3 Shimonogo Ueda Nagano 386-1211 Japan Shin-Kobe Electric Machinery Co. Ltd 1300-5 Hachiman Nabari Mie 518-0493 Japan

ISBN: (纸本)9781612849560

this paper proposes an AC/DC power supply system with DGs using the parallel processing method. the purpose of this system is to supply the power without connecting to the utility gird. the DGs consist of photovoltaic (PV), -and wind generators (WG), and the main energy source of this system is the DGs and the UPS battery. When the system does not get enough energy from the DGs, and the power supply of the battery runs out, this system connects to the utility grid and begins to charge the battery and supply to the load. In this study, we focused on the AC power supply and DC power supply from DGs. then, the converters of DGs use two types, DC/AC type and DC/DC type. the power supply system has been operated with the actual loads of 20 kW in the campus of the Aichi Institute of Technology. this paper reports on our study of DC and AC power supplies in the event of a system anomaly. © 2011 ieee.

关键词： distributed power generation

来源：评论

学校读者我要写书评

暂无评论

Embedding of k-ary complete trees into hypercubes with optimal load

Embedding of k-ary complete trees into hypercubes with optim...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： J. Trdlicka P. Tvrdik Department of Computer Science and Engineering Czech Technical University Prague Czech Republic

the main result of the paper is an algorithm for embedding k-ary complete trees into hypercubes with optimal load and asymptotically optimal dilation. the algorithm is fully scalable, the dimension of the hypercube can be chosen independently of the arity and height of the complete tree. the basic property of the embedded tree is that both all the tree nodes at a given level and all the tree nodes together are uniformly distributed within equally-sized subcubes of the hypercube. this implies that no hypercube node is loaded with more than [A/sub h//2/sup n/] tree nodes and [B/sub h//2/sup n/] leaves of the tree, where A/sub h/ is the number of all tree nodes, B/sub h/ is the number of leaves of the k-ary complete tree of height h, and n is the dimension of the hypercube. the embedding enables optimal emulations of both divide and conquer computations on the k-ary complete tree, where only one level of nodes is active at a time, and general computations based on k-ary complete trees, where all tree nodes are active simultaneously. As a special case the authors obtain an algorithm for embedding the k-ary complete tree of height h into its optimal hypercube with load 1 and with dilation that is only by a small constant factor worse than the lower bound. this improves the best previous result by Shen et al. (1995), whose embedding has load 1 and nearly optimal dilation, but requires much larger than the optimal hypercube.

关键词： Hypercubes Emulation Binary trees Computer science Embedded computing Multiprocessor interconnection networks Computer networks Concurrent computing Network topology parallel machines

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共84页 << < 68 69 70 71 72 73 74 75 76 77 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：