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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,501 篇 会议
69 篇 期刊文献
4 册 图书

馆藏范围

2,574 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,951 篇 工学
- 1,911 篇 计算机科学与技术...
- 889 篇 软件工程
- 388 篇 信息与通信工程
- 292 篇 电气工程
- 139 篇 电子科学与技术（可...
- 102 篇 控制科学与工程
- 66 篇 网络空间安全
- 32 篇 动力工程及工程热...
- 25 篇 建筑学
- 24 篇 机械工程
- 21 篇 生物医学工程（可授...
- 20 篇 土木工程
- 16 篇 生物工程
- 15 篇 交通运输工程
- 15 篇 安全科学与工程
- 14 篇 环境科学与工程（可...
- 13 篇 光学工程
- 10 篇 力学（可授工学、理...
- 10 篇 化学工程与技术
419 篇 理学
- 345 篇 数学
- 42 篇 统计学（可授理学、...
- 40 篇 系统科学
- 38 篇 物理学
- 21 篇 生物学
- 18 篇 化学
353 篇 管理学
- 304 篇 管理科学与工程(可...
- 126 篇 工商管理
- 74 篇 图书情报与档案管...
23 篇 经济学
- 22 篇 应用经济学
14 篇 法学
- 14 篇 社会学
8 篇 农学
7 篇 医学
5 篇 教育学
2 篇 文学
2 篇 军事学

主题

188 篇 parallel process...
155 篇 application soft...
137 篇 graphics process...
130 篇 parallel process...
122 篇 computer archite...
114 篇 hardware
110 篇 computational mo...
102 篇 distributed comp...
101 篇 concurrent compu...
94 篇 computer science
86 篇 runtime
86 篇 distributed comp...
84 篇 parallel program...
67 篇 scalability
65 篇 graphics process...
61 篇 libraries
61 篇 instruction sets
60 篇 resource managem...
56 篇 kernel
55 篇 bandwidth

机构

15 篇 oak ridge natl l...
12 篇 cent s univ sch ...
11 篇 argonne natl lab...
11 篇 univ tennessee k...
10 篇 guangzhou univ s...
10 篇 school of comput...
10 篇 univ manchester ...
10 篇 ohio state univ ...
8 篇 oak ridge natl l...
7 篇 univ chinese aca...
7 篇 hunan univ coll ...
6 篇 chinese acad sci...
6 篇 iit dept comp sc...
6 篇 oak ridge nation...
6 篇 hunan engn lab r...
6 篇 univ illinois de...
6 篇 department of co...
5 篇 univ sci & techn...
5 篇 georgia state un...
5 篇 georgia inst tec...

作者

16 篇 dongarra jack
13 篇 wang guojun
12 篇 sun xian-he
10 篇 cerin christophe
9 篇 schulz martin
9 篇 guo minyi
9 篇 agrawal gagan
9 篇 wolf felix
9 篇 robert yves
8 篇 matsuoka satoshi
8 篇 jin hai
7 篇 li kenli
7 篇 prasad sushil k.
7 篇 banicescu ioana
7 篇 antoniu gabriel
7 篇 kale laxmikant v...
7 篇 zhou xuehai
7 篇 labarta jesus
6 篇 li xi
6 篇 hoefler torsten

语言

2,572 篇 英文
1 篇 葡萄牙文
1 篇 其他

检索条件"任意字段=13th IEEE International Symposium on Parallel and Distributed Processing with Applications"

共 2574 条记录，以下是2271-2280 订阅

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

详细简洁

排序：

Fast parallel algorithm for distance transforms 15

Fast parallel algorithm for distance transforms

引用

15th international parallel and distributed processing symposium, IPDPS 2001

作者： Datta, A. Soundaralakshmi, S. Department of Computer Science and Software Engineering University of Western Australia PerthWA6907 Australia

ISBN: (纸本)0769509908

the distance transform (DT) is an operation to convert a binary image consisting of black and white pixels to a representation where each pixel has the distance of the nearest black pixel in a given distance metric. the DT has many applications in computer vision and image processing. In this paper, we present an O((log log N)2)-time algorithm for computing the DT of an N x N image on a Common CRCW PRAM with O(N2+Ε/ log log N) processors for any Ε such that 0 2 log log N/log N) processors on the Common CRCW PRAM. Hayashi et al. [7] presented an O(log log N) time and O(N2/ log log N) processors algorithm on the Common CRCW PRAM for computing DT. However, their algorithm works for a class of metrics called x-monotone metrics. © 2001 ieee.

关键词： Binary images

来源：评论

学校读者我要写书评

暂无评论

A microserver view of HTMT 15

A microserver view of HTMT

引用

15th international parallel and distributed processing symposium, IPDPS 2001

作者： Yerosheva, L.V. Kuntz, S.K. Brockman, J.B. Kogge, P.M. 384 Fitzpatrick Hall CSE University of Notre Dame Notre DameIN46556 United States

ISBN: (纸本)0769509908

Hybrid technology multithreaded architecture (HTMT) is an ambitious new architecture combining cutting edge technologies to reach petaflop performance sooner than current technology trends allow. It is a massively parallel architecture with multi-threaded hardware and a multi-level memory hierarchy. Microservers provide a new perspective for viewing this memory hierarchy whereby memory is actively involved in process execution. this paper discusses the microserver memory semantics and initial HTMT execution models to analyze application at each level of the system hierarchy and to develop user-level functions for expressing this inherent concurrency and parallelism. In order to do this we studied several applications to model the control and data flow within the HTMT hierarchy and developed pseudo-code representing the user-level functions necessary to express application concurrency and parallelism. © 2001 ieee.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Emulating petaflops machines and blue gene 15

Emulating petaflops machines and blue gene

引用

15th international parallel and distributed processing symposium, IPDPS 2001

作者： Saboo, N. Singla, A.K. Unger, J.M. Kalé, L.V. Dept. of Computer Science University of Illinois at Urbana-Champaign 1304 W. Springfield Ave. UrbanaIL61801 United States

ISBN: (纸本)0769509908

PetaFLOPS-class computers, based on the current or foreseeable CMOS generation, appear to be feasible in the near future. An emulator for a petaFLOPS-class programming environment is necessary to facilitate offline development and debugging of applications, and exploration of programming models. Such an emulator must be able to run on large traditional parallel machines. this paper describes the design and implementation of an emulator for a class of petaFLOPS machines. the machine parameters can be varied to cover a variety of possible architectures within this class, although our current implementation is influenced by (and is targeted to emulate) an initial design of the Blue Gene Machine being developed by IBM. Our implementation is based on Charm++, an object-basedmessage-driven parallel execution model, which allows emulation of multiple Blue Gene nodes to a single physical processor. We demonstrate the feasibility of our approach by emulating short million-processor programs on less than a hundred processors of the ASCI-Red machine. © 2001 ieee.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Predicting scalability of parallel garbage collectors on shared memory multiprocessors 15

Predicting scalability of parallel garbage collectors on sha...

引用

15th international parallel and distributed processing symposium, IPDPS 2001

作者： Endo, T. Taura, K. Yonezawa, A. Department of Information Science Faculty of Science University of Tokyo 7-3-1 Hongo Bunkyo-kuTokyo113-0033 Japan

ISBN: (纸本)0769509908

this paper describes a performance prediction model of parallel mark-sweep garbage collectors (GC) on shared memory multiprocessors. the prediction model takes the heap snapshot and memory access cost parameters (latency and occupancy) as inputs, and outputs performance of the parallel marking on any given number of processors. It takes several factors Mat affects performance into account: cache misses costs, memory access contention, and increase of misses by parallelization We evaluate this model by comparing the predicted GC performance and measured performance on two architecturally different shared memory machines: Ultra Enterprise 10000 (crossbar connected SMP) and Origin 2000 (hypercube connected DSM). Our model accurately predicts qualitatively different speedups on the two machines that occurred in one application, which turn out to be due to contentions on a memory node. Lit addition to performance analysis, applications of the proposed model include adaptive GC algorithm to achieve optimal performance based on the prediction. this paper shows the effect of automatic regulation of GC parallelism. © 2001 ieee.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Wide-Area Transposition-Driven Scheduling

Wide-Area Transposition-Driven Scheduling

引用

10th Annual ieee international symposium on High Performance distributed Computing

作者： Romein, JW Bal, HE Vrije Univ Amsterdam Dept Math & Comp Sci Fac Sci Amsterdam Netherlands

ISBN: (纸本)0769512968

distributed search of state spaces containing cycles is a challenging task and has been studied for years. Traditional parallel search algorithms either ignore the cyclic nature of the state space and waste much time in duplicated search effort, or rely on heavy communication to reduce duplicate work, resulting in a large communication overhead. Both methods perform poorly, even when using a fast, local interconnect, A recently developed task-distribution scheme, Transposition-Driven Scheduling (TDS), performs much better, since it communicates asynchronously and efficiently, suppresses duplicate search effort. TDS, however, requires bandwidths of megabytes per second per processor In this paper, we investigate how cyclic state spaces can be searched efficiently on a meta-computing system containing multiple clusters, connected by high-latency, low-bandwidth wide-area links. this is quite a challenge, because the wide-area links provide neither the bandwidth required for TDS, nor the latency required for traditional distributed search algorithms. We propose a scheme that strongly reduces communication between clusters, at the expense of some duplicate search effort. Performance measurements for several applications show that the new scheme outperforms traditional schemes by a wide margin.

关键词： meta computing distributed search distributed supercomputing Transposition-Driven Scheduling

来源：评论

学校读者我要写书评

暂无评论

Overview of security considerations for computational and data Grids

Overview of security considerations for computational and da...

引用

10th Annual ieee international symposium on High Performance distributed Computing

作者： Johnston, WE Jackson, KR Talwar, S NASA Ames Res Ctr Lawrence Berkeley Natl Lab Berkeley CA USA

ISBN: (纸本)0769512968

Large-scale science and engineering is frequently done through the interaction of collaborating groups, heterogeneous computing resources, information systems, and instruments, all of which are geographically and organizationally dispersed. the overall motivation for "Grids" is to enable the routine interactions of these resources to enhance this type of large-scale science and engineering, and thus substantially increase the computing and data handling capabilities available to science and engineering projects. However, even if this environment works in every other way, it will not be viable if it is constantly disrupted by hackers and their kin. distributed applications are potentially more vulnerable than conventional scientific problem solving environments because there are substantially more targets to attack in order to impact a single application. Much of the overall security of Grids is inherited from the security of the underlying systems. there are, however, some security considerations at the Grid level that are independent of the underlying systems, and we focus on this later aspect.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Analysis and evaluation of a distributed monitor construct in java 15

Analysis and evaluation of a distributed monitor construct i...

引用

15th international parallel and distributed processing symposium, IPDPS 2001

作者： Cheung, N.K.C. Cao, Jiannong Chan, A. Internet Computing and E-Commerce Lab. Department of Computing Hong Kong Polytechnic University Hung Hom Kowloon Hong Kong

ISBN: (纸本)0769509908

this paper describes a distributed monitor construct implemented in Java. the monitor construct has been widely used for ensuring mutual exclusion and achieving process synchronization in a centralized multi-programming environment. Extending the monitor to a distributed environment facilitates the development of distributed applications which require resource sharing and synchronization. the distributed monitor construct presented in this paper is based on a well-known tree-based distributed mutual exclusion algorithm proposed by Kerry Raymond, augmented with of a two-level system structure for scalability and efficiency. the design and implementation of the facility in Java has been presented in a previous paper. In this paper we focus on the correctness analysis and performance evaluation of the construct. Using a Java application for solving the distributed version of the producer-consumer problem, experiments have been carried out to evaluate the performance of the proposed distributed constructor. the results show that, with the use of the two-level system architecture, the average amount of time and the average number of messages used by a process to gain permission to enter its critical section are improved. Furthermore, factors that affect the performance including the tree configuration, the distribution of processes over the nodes, the workload, and the length of the critical sections, are discussed and the observations from the results are reported. © 2001 ieee.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

An adaptive and aggressively bounded convergence algorithm for enhancing and measuring the performance of applications running on networks with heavy-tailed distributions 15

An adaptive and aggressively bounded convergence algorithm f...

引用

15th international parallel and distributed processing symposium, IPDPS 2001

作者： Wong, J.H.C. Ip, M.T.W. Wong, A.K.Y. Department of Computing Hong Kong Polytechnic University Hunghom Kowloon Hong Kong

ISBN: (纸本)0769509908

the proposed convergence algorithm quickly and accurately predicts the mean response times of Internet channels operating with request-response type of communication protocols. At first, how the convergence algorithm was verified and validated in our previous work will be concisely described. A previous time-out message transmission model has been devised using the validated algorithm as a tool to control message transmission and re-transmission in networks with heavy tailed distributions. First, the shortcomings of our previous time-out message transmission model and its effects on the resulting response time of an application will be presented. Second, a new hybrid model will be proposed in this paper to address the shortcomings. © 2001 ieee.

关键词： aggressive message transmission convergence algorithm end-to-end approach heavy tailed distribution message response time message retransmission time-out window

来源：评论

学校读者我要写书评

暂无评论

Priority based messaging for software distributed shared memory 15

Priority based messaging for software distributed shared mem...

引用

15th international parallel and distributed processing symposium, IPDPS 2001

作者： Karlsson, S. Brorsson, M. Department of Microelectronics and Information Technology Royal Institute of Technology Stockholm Sweden

ISBN: (纸本)0769509908

Software distributed Shared Memory (DSM) systems can be used to provide a coherent shared address space on multicomputers and other parallel systems without support for shared memory in hardware. the coherency software automatically translates shared memory accesses to explicit messages exchanged among the nodes in the system. Many applications exhibit a good performance on such systems but it has been shown that performance critical messages can be delayed behind less important messages because of the enqueuing behavior in the communication libraries used in current systems. We present in this paper a new portable communication library that supports priorities to remedy this situation. We describe an implementation of the communication library and a quantitative model that is used to estimate the performance impact of priorities for a typical situation. Using the model, we show that the use of high-priority communication reduces the latency of performance critical messages substantially over a wide range of network design parameters. the latency is reduced with up to 10-25% for each delaying low priority message in the queue ahead. © 2001 ieee.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Checkpointing and rollback of wide-area distributed applications using mobile agents 15

Checkpointing and rollback of wide-area distributed applicat...

引用

15th international parallel and distributed processing symposium, IPDPS 2001

作者： Cao, Jiannong Chan, G.H. Jia, Weijia Dillon, T.S. Internet Computing and E-Commerce Lab. Department of Computing Hong Kong Polytechnic University Hung Hom Kowloon Hong Kong Dept. of Computer Science City University of Hong Kong Kowloon Tong Kowloon Hong Kong

ISBN: (纸本)0769509908

We consider the problem of designing rollback error recovery algorithms for dynamic, wide area distributed systems like the Internet. the characteristics and the scale of such a system complicate the design and performance of the algorithms. Traditional message passing based algorithms incur large overhead, in both the network traffic and message passing delay, in such a wide-area environment. In this paper, we propose a novel approach to designing checkpointing and rollback algorithms using mobile agents as an aid. Using mobile agent leads to a reduction of the total amount of communication and allows us to design algorithms that take the advantage of the most up to date system information for decision making. It also allows us to develop algorithms implementing flexible and adaptive policies. A mobile agent enabled hybrid algorithm combining independent and coordinated checkpointing is proposed. A prototype of the algorithms is developed using IBM's Aglets. Results of performance evaluation are presented and discussed. © 2001 ieee.

关键词： Mobile agents

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共258页 << < 224 225 226 227 228 229 230 231 232 233 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：