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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

161 篇 会议
4 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

143 篇 工学
- 133 篇 计算机科学与技术...
- 66 篇 软件工程
- 24 篇 信息与通信工程
- 13 篇 电气工程
- 10 篇 材料科学与工程（可...
- 8 篇 电子科学与技术（可...
- 8 篇 控制科学与工程
- 6 篇 机械工程
- 6 篇 网络空间安全
- 5 篇 农业工程
- 3 篇 力学（可授工学、理...
- 3 篇 建筑学
- 3 篇 生物医学工程（可授...
- 3 篇 生物工程
- 2 篇 土木工程
- 1 篇 光学工程
- 1 篇 仪器科学与技术
- 1 篇 冶金工程
- 1 篇 化学工程与技术
57 篇 理学
- 50 篇 数学
- 7 篇 统计学（可授理学、...
- 5 篇 系统科学
- 3 篇 生物学
- 2 篇 物理学
- 1 篇 化学
14 篇 管理学
- 11 篇 管理科学与工程(可...
- 6 篇 工商管理
- 3 篇 图书情报与档案管...
5 篇 农学
- 5 篇 作物学
1 篇 经济学
- 1 篇 应用经济学
1 篇 医学

主题

11 篇 parallel process...
8 篇 parallel process...
8 篇 distributed comp...
7 篇 concurrent compu...
7 篇 grid computing
6 篇 parallel archite...
6 篇 database systems
4 篇 parallel algorit...
4 篇 application soft...
4 篇 fault tolerance
4 篇 parallel program...
4 篇 computer network...
3 篇 computer systems...
3 篇 high performance...
3 篇 distributed comp...
2 篇 memory managemen...
2 篇 encoding (symbol...
2 篇 merging
2 篇 research and dev...
2 篇 graphics process...

机构

2 篇 hong kong polyte...
2 篇 school of comput...
2 篇 illinois institu...
2 篇 tohoku univ info...
2 篇 tohoku univ grad...
2 篇 department of co...
2 篇 ibm corporation ...
2 篇 louisiana state ...
2 篇 national laborat...
2 篇 department of co...
1 篇 department of el...
1 篇 department of in...
1 篇 school of inform...
1 篇 merit technology...
1 篇 pc2-paderborn ce...
1 篇 nanyang technol ...
1 篇 school of comput...
1 篇 acad sinica inst...
1 篇 computer science...
1 篇 univ politecn ca...

作者

4 篇 zheng wm
2 篇 chang zhi-ming
2 篇 wang cho-li
2 篇 lakshmivarahan s...
2 篇 wojcik zbigniew ...
2 篇 bernard t
2 篇 bui a
2 篇 cao jn
2 篇 shu jw
2 篇 wojcik barbara e...
2 篇 ghafoor arif
2 篇 wang tianqi
2 篇 raad peter e.
2 篇 lau francis c. m...
2 篇 olariu s.
2 篇 jiang yan-huang
2 篇 dhall s.k.
2 篇 yang xue-jun
2 篇 zheng s.q.
1 篇 deen sm

语言

165 篇 英文

检索条件"任意字段=2nd IEEE Symposium on Parallel and Distributed Processing, SPDP 1990"

共 165 条记录，以下是111-120 订阅

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

详细简洁

排序：

HPGraph: A High parallel Graph processing System Based on Flash Array

HPGraph: A High Parallel Graph Processing System Based on Fl...

引用

18th ieee International Conference on High Performance Computing and Communications, 14th ieee International Conference on Smart City and 2nd ieee International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2016

作者： Xing, Yuxuan Feng, Ya Yu, Songping Chen, Zhengguo Liu, Fang Xiao, Nong State Key Lab. of High Performance Comput. Nat. Univ. of Defense Technol. Changsha China School of Data and Computer Science Sun Yat-sun University Guangzhou China

ISBN: (纸本)9781509042968

Large graphs analytics has been an important aspect of many big data applications, such as web search, social networks and recommendation systems. Many research focuses on processing large scale graphs using distributed system over past few years. And numbers of studies turn to construct graph processing system on a single server-class machine in consideration of cost, usability and maintainability. HPGraph is a high parallel graph processing system which adopts the edge-centric model, our contributions are as follows: (1) designing an efficient data allocation and access strategy for NUMA machine, and providing tasks scheduling to keep load balance, (2) raising a fine-grained edge-block filtering mechanism to avoid accessing unnecessary edge data, (3) constructing a high-speed flash array as the second storage. We made a detailed evaluation on a 16-core machine using asset of popular real word and synthetic data sets, and the results show that HPGraph always outperforms the state-of-the-art single machine graph processing systems-GridGraph. And HPGraph can achieve 1.27X faster than GridGraph for specific application. Our source code is available at https://***/xinghuan1990/HPGraph. © 2016 ieee.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Telegraphos: high-performance networking for parallel processing on workstation clusters

Telegraphos: high-performance networking for parallel proces...

引用

Proceedings of the 1996 2nd International symposium on High-Performance Computer Architecture, HPCA

作者： Markatos, Evangelos P. Katevenis, Manolis G.H. Crete Greece

Networks of workstations and high-performance microcomputers have been rarely used for running high-performance applications like multimedia, simulations, scientific and engineering applications, because, although they have significant aggregate computing power, they lack the support for efficient message-passing and shared-memory communication. In this paper we present Telegraphos, a distributed system that provides efficient shared-memory support on top of a workstation cluster. We focus on the network interface of Telegraphos that provides a variety of shared-memory operations like remote reads, remote writes, remote atomic operations, all launched from user level without any intervention of the operating system. Telegraphos I, the first Telegraphos prototype has been implemented. Emphasis was put on rapid prototyping, so the technology used was conservative: FPGA's, SRAM's, and TTL buffers. Telegraphos II, is the single-chip version of the Telegraphos architecture;its switch was implemented and its network interface is being debugged.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Resource management for distributed parallel systems 2

Resource management for distributed parallel systems

引用

2nd International symposium on High Performance distributed Computing, HPDC 1993

作者： Neuman, B.C. Rao, S. Inf. Sci. Inst. Univ. of Southern California Los AngelesCA United States

ISBN: (纸本)0818639008

Multiprocessor systems should exist in the larger context of distributed systems, allowing multiprocessor resources to be shared by those that need them. Unfortunately, typical multiprocessor resource management techniques do not scale to large networks. The Prospero Resource Manager (PRM) is a scalable resource allocation system that supports the allocation of processing resources in large networks and multiprocessor systems. To manage resources in such distributed parallel systems, PRM employs three types of managers: system managers, job managers, and node managers. There exist multiple independent instances of each type of manager, reducing bottlenecks. The complexity of each manager is further reduced because each is designed to utilize information at an appropriate level of abstraction. © 1993 ieee.

关键词： Managers

来源：评论

学校读者我要写书评

暂无评论

Towards correct distributed simulation of high-level Petri nets with fine-grained partitioning

引用

2nd International symposium on parallel and distributed processing and Applications

作者： Knoke, M Kühling, F Zimmermann, A Hommel, G Tech Univ Berlin D-10587 Berlin Germany

ISBN: (纸本)3540241280

Powerful grid and cluster computers allow efficient distributed simulation. Optimistic simulation techniques have been developed which allow for more parallelism in the local simulations than conservative methods. However, they may require costly rollbacks in simulation time due to dependencies between model parts that cause violations of global causality. Different notions of time have been proposed to detect and remedy these situations. Logical time (or Lamport time) is used in many present-day distributed simulation algorithms. However, high-level colored Petri nets may contain global activity priorities, vanishing states, and global state dependencies. Thus virtual time is not sufficient to maintain the global chronological order of events for the optimistic simulation of this model class. The paper presents a new approach that guarantees a correct ordering of global states in a distributed Petri net simulation. A priority-enhanced vector time algorithm is used to detect causal dependencies.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Framework for automated software partitioning and mapping for distributed multiprocessors

Framework for automated software partitioning and mapping fo...

引用

Proceedings of the 1996 2nd International symposium on parallel Architectures, Algorithms, and Networks, I-SPAN

作者： Ramanujan, Ranga S. Bonney, Jordan C. Thurber, Kenneth J. Jha, Rakesh Siegel, Howard Jay Architecture Technology Corp Minneapolis United States

One of the major impediments to the widespread use of large-scale, distributed memory multiprocessors is the difficulty of efficiently partitioning and mapping application algorithms onto these machines so as to extract a large portion of the machines' peak performance. In this paper, we present the preliminary accomplishments of an ongoing effort aimed at automating the complex tasks of software partitioning and mapping during the system definition phase of application development for distributed memory multiprocessors. We describe a technique called the Augmented Task Dependency Graph (ATDG) for representing the high-level design of the application software. The ATDG allows one to express functional parallelism as well as data parallelism in a manner that facilitates automated partitioning and mapping. We propose a new strategy for searching through the possible space of design choices for partitioning and mapping. The proposed approach, called hierarchical hybrid search, organizes the search space as a hierarchy of sub-spaces. It permits the use of different search techniques for searching through different search sub-spaces. Examples of search techniques that could be employed in the proposed approach include hill-climbing, simulated annealing, and genetic algorithms.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Pezw-id: An algorithm for distributed parallel embedded zerotree wavelet encoder

引用

2nd International symposium on parallel and distributed processing and Applications, ISPA 2004

作者： Chang, Zhi-Ming Jiang, Yan-Huang Yang, Xue-Jun Qu, Xiang-Li School of Computer National University of Defense Technology ChangShaHunan China

ISBN: (纸本)9783540241287

The image compression algorithm based on EZW can get any compression ratio as specified, which is widely used in the field of image processing. However, with massive computation during wavelet transformation and multiple scans of the transformed wavelet coefficient matrix during encoding processing, much time is consumed. Therefore, both the parallelism of wavelet transformation and zerotree encoding for EZW are necessary, and then we present PEZW-ID: an algorithm for distributed parallel embedded zerotree wavelet encoder. This paper describes the flow of the algorithm, proves the validity, and shows the performance analysis. Finally, with the experimental results under MPP, the parallelism and scalability of the algorithm have been verified. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

parallel transient stability simulation for national power grid of China

引用

2nd International symposium on parallel and distributed processing and Applications (ISPA 2004)

作者： Xue, W Shu, JW Zheng, WM Tsinghua Univ Dept Comp Sci Beijing 100084 Peoples R China

ISBN: (纸本)3540241280

With the development of modern power system. real-time simulation and on-line control are becoming more and more critical. Transient stability analysis, where the most intensive computation locates, is the bottleneck of real-time simulation for large-scale power system. Thus, the key to achieve the real-time simulation of large scale power systems is to find the new transient stability algorithms and parallel software with high-performance computers. This paper presents a new spatial parallel transient stability algorithm including an improved parallel network algorithm and an optimal convergence checking method. The simulation software with the spatial parallel algorithm is designed and implemented on a SMP-cluster system. The test cases of national power grid of China show that the optimal computation time of the parallel software is only 38% of the actual dynamic process. It is suggested that the algorithms described in this paper can achieve the super real-time simulation of very large scale power system and make the complex on-line power applications, especially on-line supervision and control for large scale power system, feasible.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A scalable low discrepancy point generator for parallel computing

引用

2nd International symposium on parallel and distributed processing and Applications, ISPA 2004

作者： Liu, Kwong-Ip Hickernell, Fred J. Department of Mathematics Hong Kong Baptist University Kowloon Hong Kong

ISBN: (纸本)9783540241287

The Monte Carlo (MC) method is a simple but effective way to perform simulations involving complicated or multivariate functions. The Quasi-Monte Carlo (QMC) method is similar but replaces independent and identically distributed (i.i.d.) random points by low discrepancy points. Low discrepancy points are regularly distributed points that may be deterministic or randomized. The digital net is a kind of low discrepancy point set that is generated by number theoretical methods. A software library for low discrepancy point generation has been developed. It is thread-safe and supports MPI for parallel computation. A numerical example from physics is shown. © Springer-Verlag Berlin Heidelberg 2004.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT parallel ALGORITHMS FOR FUNCTIONAL DEPEndENCY MANIPULATIONS 90

引用

2nd INTERNATIONAL SYMP ON DATABASES IN parallel And distributed SYSTEMS ( DPDS 90 )

作者： SRIDHAR, R IYENGAR, SS Department of Computer Science Louisiana State University Baton Rouge LA

ISBN: (纸本)0818620528

Given a set of functional dependencies Σ and a single dependency σ, we show that the algorithm to test whether Σ implies σ is log-space complete in P. The functional dependencies Σ are represented as a directed hypergraph HΣ [1]. We first present a parallel algorithm which solves the above implication problem using P processors on a EREW-PRAM in Ο(e/P + ***) time and on a CRCW-PRAM in Ο(e/P + n) time, where e and n are the number of arcs and nodes of the graph HΣ. For graphs HΣ with fixed degree and diameter, we show that the closure HΣ+ can be computed in NC. We present NC algorithms to obtain a non-redundant and a LR-Minimum cover for the set of functional dependencies Σ. All our algorithms on a n-node directed hypergraph with fixed degree and diameter can be implemented to run in Ο(log2n) time with M(n) processors on a CREW-PRAM model, where M(n) is the cost of multiplying two binary matrices. The algorithms are efficient based on the transitive closure bottleneck phenomenon [7] that is, any improvement in the time and processor complexity of the transitive closure algorithm will result in an improvement by the same amount for the algorithms presented here.

关键词： functional dependency processor complexity minimal cover directed hyper-graph parallel algorithm log-space reduction NC algorithm time complexity non-redundant cover relational databases minimum cover

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共17页 << < 8 9 10 11 12 13 14 15 16 17 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：