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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

2,759 篇 工学
- 2,601 篇 计算机科学与技术...
- 1,584 篇 软件工程
- 533 篇 信息与通信工程
- 427 篇 电气工程
- 267 篇 控制科学与工程
- 188 篇 电子科学与技术（可...
- 174 篇 网络空间安全
- 44 篇 机械工程
- 43 篇 生物医学工程（可授...
- 37 篇 动力工程及工程热...
- 31 篇 生物工程
- 28 篇 力学（可授工学、理...
- 26 篇 建筑学
- 23 篇 安全科学与工程
- 22 篇 材料科学与工程（可...
- 21 篇 化学工程与技术
- 20 篇 仪器科学与技术
- 19 篇 土木工程
- 19 篇 交通运输工程
1,100 篇 理学
- 982 篇 数学
- 135 篇 统计学（可授理学、...
- 98 篇 物理学
- 72 篇 系统科学
- 38 篇 生物学
- 26 篇 化学
420 篇 管理学
- 326 篇 管理科学与工程(可...
- 202 篇 工商管理
- 121 篇 图书情报与档案管...
37 篇 经济学
- 37 篇 应用经济学
27 篇 法学
- 26 篇 社会学
20 篇 医学
15 篇 农学
12 篇 教育学
3 篇 文学
1 篇 军事学
1 篇 艺术学

主题

494 篇 parallel process...
276 篇 distributed comp...
216 篇 parallel process...
195 篇 distributed comp...
178 篇 concurrent compu...
170 篇 parallel algorit...
167 篇 computer science
117 篇 application soft...
112 篇 computer archite...
89 篇 parallel program...
89 篇 hardware
80 篇 computational mo...
76 篇 computer network...
72 篇 costs
72 篇 algorithm design...
65 篇 processor schedu...
64 篇 delay
55 篇 grid computing
49 篇 fault tolerance
48 篇 scalability

机构

12 篇 syracuse univ sy...
12 篇 pacific northwes...
11 篇 georgia inst of ...
9 篇 new jersey inst ...
9 篇 univ of maryland...
9 篇 national laborat...
8 篇 univ of californ...
8 篇 michigan state u...
8 篇 univ ottawa site...
7 篇 texas a&m univ c...
7 篇 ibm thomas j. wa...
7 篇 purdue univ west...
7 篇 ieee
6 篇 carleton univ sc...
6 篇 school of comput...
6 篇 shanghai jiao to...
6 篇 univ of minnesot...
6 篇 univ of central ...
6 篇 univ of illinois...
6 篇 carleton univ ot...

作者

15 篇 boukerche azzedi...
13 篇 bader david a.
11 篇 das sajal k.
9 篇 ranka sanjay
9 篇 li keqin
8 篇 sohn andrew
7 篇 panda dhabaleswa...
7 篇 prasanna viktor ...
7 篇 choudhary alok
7 篇 sato mitsuhisa
6 篇 taura kenjiro
6 篇 ibarra oscar h.
6 篇 zomaya albert y.
6 篇 yang laurence t.
6 篇 welch lonnie r.
6 篇 zhang xiaodong
6 篇 cristea valentin
6 篇 nakano koji
6 篇 sun xian-he
6 篇 boukerche a

语言

3,522 篇 英文
12 篇 其他
2 篇 中文

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

共 3536 条记录，以下是3231-3240 订阅

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

详细简洁

排序：

distributed algorithms on edge connectivity problems

Distributed algorithms on edge connectivity problems

引用

International symposium on parallel and distributed processing (IPDPS)

作者： S.-N. Yang M.-S. Cheng Department of Computer Science National Tsing Hua University Hsinchu Taiwan Computer & Communication Research Laboratory Industrial Technology and Research Institute Hsinchu Taiwan

Connectivity of a network dictates the routability and survivability of a network. the paper investigates the edge connectivity problems in distributed environments. For a given network or graph G, one can distributively find bridges in the network first then find the 2-edge connected components. Both algorithms proposed, bridge finding and 2-edge connected component identifying, require only O(m) message complexity, where m is the number of edge in G. the paper also shows an efficient distributed 2-edge cutset algorithm that has O(n/sup 2/) message complexity, where n is the number of nodes in G.< >

关键词： distributed algorithms Communication networks Bridge circuits Telecommunication network reliability Computer science Integrated circuit interconnections Multiprocessor interconnection networks Circuit synthesis Labeling Councils

来源：评论

学校读者我要写书评

暂无评论

Notes on Maekawa's O(/spl radic/N) distributed mutual exclusion algorithm

Notes on Maekawa's O(/spl radic/N) distributed mutual exclus...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： Y.-I. Chang Department of Applied Mathematics National Sun Yat-Sen University Kaohsiung Taiwan

Maekawa's algorithm is one of well-known distributed mutual exclusion algorithms and requires only O(/spl radic/N) messages per CS execution, where N is the number of sites in the system. However, Maekawa's algorithm can work well only if the pipelining property is satisfied (i.e., between any pair of sites, messages are delivered in the order in which they are sent). In this paper, we show how to modify Maekawa's algorithm to let it work well even when the pipelining property is no longer satisfied. Moreover, we discuss some interesting results of a simulation study of Maekawa'a algorithm which show that more than N messages may be needed in Maekawa's algorithm.< >

关键词： Pipeline processing Communication networks Delay effects System recovery Algorithm design and analysis Discrete event simulation Out of order

来源：评论

学校读者我要写书评

暂无评论

Embedding between 2-D meshes of the same size

Embedding between 2-D meshes of the same size

引用

International symposium on parallel and distributed processing (IPDPS)

作者： X. Shen W. Liang Q. Hu Computer Science Telecommunications Program University of Missouri Kansas City Kansas City MO USA

It is shown how to embed an x/sub 1/ /spl times/ 1/sub 1/ mesh M/sub 1/ into an s/sub 2/ /spl times/ t/sub 2/ mesh M/sub 2/, where s/sub 1/ /spl times/ t/sub 2/, s/sub 1/

It is shown how to embed an x/sub 1/ /spl times/ 1/sub 1/ mesh M/sub 1/ into an s/sub 2/ /spl times/ t/sub 2/ mesh M/sub 2/, where s/sub 1/ /spl times/ t/sub 2/, s/sub 1/ < t/sub i/ (i = 1,2) such that the dilation is minimized. It is assumed that load = 1 and expansion = 1. For each case there is shown a lower bound on the dilation and a corresponding embedding method. the dilations by these embedding algorithms either match a lower bound or are very close to a lower bound.< >

关键词： Hypercubes Binary trees Cities and towns Network topology Computer science parallel processing parallel algorithms Algorithm design and analysis Very large scale integration Upper bound

来源：评论

学校读者我要写书评

暂无评论

parallel network dual simplex method on a shared memory multiprocessor

Parallel network dual simplex method on a shared memory mult...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： K. thulasiraman R.P. Chalasani M.A. Comeau Concordia University Montreal Canada

We present a parallel algorithm for solving the dual transshipment problem. the traditional dual simplex method does not offer much scope for parallelization, because it moves from one basic feasible solution to another, performing one pivot operation at a time. We present a new method called modified network dual simplex method which uses concurrent pivots. this departure from the traditional LP approach raises several issues such as the need to convert a non-basic feasible solution to a basic feasible solution. We present our strategies to handle these issues as well as the corresponding parallel algorithms. We also present results of testing this algorithm on large graphs to solve the integrated layout compaction and wire balancing problem.< >

关键词： parallel algorithms Wire Very large scale integration Compaction Joining processes Testing Tree graphs Linear programming Relaxation methods Design methodology

来源：评论

学校读者我要写书评

暂无评论

On the granularity of events when modeling program executions

On the granularity of events when modeling program execution...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： E. Leu A. Schiper IBM Research Division Almaden Research Center San Jose CA USA Département dE28099Informatique Ecole Polytechnique Fédérale de Lausanne Lausanne Switzerland

In the context of parallel and distributed programming, program execution models are required to obtain a better understanding of the behavior, properties, and characteristics of parallel and distributed applications. One commonly adopted approach consists of representing an execution as a set of events and relations that capture the ordering of the events. the main disadvantages of most existing models are (1) the gap between the user's view of the execution and the program execution model, and (2) their inability to uniquely characterize an execution in terms of program behavior. the goal of this paper is to solve these two problems by first defining a new program execution model that enables more coarse-grained events to be considered, and then determining sufficient conditions for the model to uniquely identify the sequence of local states each process goes through.< >

关键词： Concurrent computing distributed computing parallel programming Context modeling Libraries Communication standards Memory architecture Message passing Broadcasting Debugging

来源：评论

学校读者我要写书评

暂无评论

Broadcasting multiple messages in simultaneous send/receive systems

Broadcasting multiple messages in simultaneous send/receive ...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： A. Bar-Noy S. Kipnis IBM Thomas J. Watson Research Center Yorktown Heights NY USA

We investigate the problem of broadcasting multiple messages in a message-passing system that supports simultaneous send and receive. the system consists of n processors, one of which has m messages to broadcast to the other n-1 processors. the processors communicate in rounds. In each round, a processor can simultaneously send a message to one processor and receive a message from another processor. the goal is to broadcast the m messages among the n processors in the minimal number of communication rounds. the lower bound on the number of rounds required is (m-1)+[log n]. We present an algorithm for this problem that requires at most m+[log n] communication rounds, for any values of m and n.< >

关键词： Broadcasting Multimedia communication Multimedia databases Algorithm design and analysis Hypercubes Computer networks Transaction databases Computer network management Protocols distributed processing

来源：评论

学校读者我要写书评

暂无评论

Measures of importance and symmetry in distributed systems

Measures of importance and symmetry in distributed systems

引用

International symposium on parallel and distributed processing (IPDPS)

作者： M.L. Neilsen Computer Science Department Oklahoma State University Stillwater OK USA

Quorum-based protocols can be formalized in terms of the data structures they use. these data structures, called quorum structures, include quorum sets, coteries, and bicoteries. In this paper, we present measures that can be used to determine the relative importance of each node in a quorum structure. By knowing the relative importance of each node in the system, it is possible to improve the overall system reliability by investing more effort on improving the reliability of important nodes. Secondly, such measures can be used to accurately define symmetry in a distributed system. A quorum structure is symmetrical, if all nodes are equally important. Finally, since several well known protocols are based on composition, we present simple recursive methods to compute the importance of nodes in composite quorum structures.< >

关键词： Protocols Data structures Power measurement Computer science Communication system control Nominations and elections Size measurement Availability Power system reliability Sections

来源：评论

学校读者我要写书评

暂无评论

Group membership in a synchronous distributed system

Group membership in a synchronous distributed system

引用

International symposium on parallel and distributed processing (IPDPS)

作者： G. Alari A. Ciuffoletti Cagliari Italy Dipartimento di Informatica Pisa Italy

this paper presents a solution to the (processor) group membership problem. the methodology followed in designing the algorithm is summarized by the option to optimize the performance of the algorithm under the assumption that no failure occurs during its run, and adding the appropriate level of fault tolerance by implementing the algorithm as periodic and self-stabilizing. the performance indicators we consider are the number of message exchanges (between neighbor units) and the time needed to reach the agreement. the algorithm relies on the existence of three basic distributed services: clock synchronization, reliable diffusion, and local agreement between two neighbors. We do not assume the presence of a reliable datagram service, which is more complex to implement than the previous. the presence of a privileged unit (initiator) is avoided, so elections are not needed.< >

关键词： Algorithm design and analysis Clocks Synchronization Timing Design methodology Design optimization Fault tolerance Nominations and elections Reliability engineering Design engineering

来源：评论

学校读者我要写书评

暂无评论

Representation of coherency classes for parallel systems

Representation of coherency classes for parallel systems

引用

International symposium on parallel and distributed processing (IPDPS)

作者： W. Hussak J.A. Keane Department of Computer Studies University of Technology Loughborough UK Centre for Novel Computing Department of Computer Science University of Manchester Institute of Science and Technology Manchester UK

Some parallel applications do not require a precise imitation of the behavior of the physically shared memory programming model. Consequently, certain parallel machine architectures have elected to emphasize different required coherency properties because of possible efficiency gains. this has led to various definitions of models of store coherency. these definitions have not been amenable to detailed analysis and, consequently, inconsistencies have resulted. In this paper a unified framework is proposed in which different models of store coherency are developed systematically by progressively relaxing the constraints that they have to satisfy. A demonstration is given of how formal reasoning can be carried out to compare different models. Some real-life systems are considered and a definition of a version of weak coherency is found to be incomplete.< >

关键词： Concurrent computing Physics computing parallel machines Hardware Application software parallel programming Programming profession Scalability distributed computing Computer architecture

来源：评论

学校读者我要写书评

暂无评论

A data-parallel approach to the implementation of weighted medians technique on parallel/super-computers

A data-parallel approach to the implementation of weighted m...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： K.P. Lam E. Horne Computing Laboratory University of Kent Canterbury UK University of Kent Canterbury Kent GB Kent Univ. Canterbury UK

Nonlinear filters have been used in many signal processing applications, for example, to obtain optimum signal extraction or detection in the presence of random noise. the weighted median filter (WMF), of which the standard median is a special case, is a novel nonlinear technique designed for 2D image processing. A major advantage of the WMF is its flexibility in design to deal with a wide variety of properties. this paper describes a commonly used class W(4,4,1) of the WMF. AS with most nonlinear methods, the computational demands of this technique are high and require a non-trivial number of "expensive" operations. A data parallel approach for efficient implementation of the WMF is described and implemented on two architecturally dissimilar supercomputers, the Convex C3840 and the Connection Machine CM-200. An analysis of the performance obtained from these two high performance parallel platforms is presented.< >

关键词： Filters Concurrent computing Laboratories Image processing Image converters Performance analysis Control systems parallel algorithms parallel processing parallel architectures

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共354页 << < 320 321 322 323 324 325 326 327 328 329 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：