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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,699 篇 会议
48 册 图书
25 篇 期刊文献

馆藏范围

1,772 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,366 篇 工学
- 1,236 篇 计算机科学与技术...
- 550 篇 软件工程
- 241 篇 信息与通信工程
- 219 篇 电气工程
- 74 篇 控制科学与工程
- 50 篇 电子科学与技术（可...
- 43 篇 生物工程
- 34 篇 机械工程
- 26 篇 动力工程及工程热...
- 22 篇 仪器科学与技术
- 21 篇 力学（可授工学、理...
- 20 篇 建筑学
- 19 篇 土木工程
- 18 篇 生物医学工程（可授...
- 15 篇 材料科学与工程（可...
- 15 篇 安全科学与工程
- 14 篇 化学工程与技术
- 13 篇 石油与天然气工程
329 篇 理学
- 227 篇 数学
- 55 篇 物理学
- 51 篇 生物学
- 29 篇 系统科学
- 28 篇 统计学（可授理学、...
- 20 篇 化学
213 篇 管理学
- 157 篇 管理科学与工程(可...
- 66 篇 图书情报与档案管...
- 49 篇 工商管理
71 篇 医学
- 62 篇 临床医学
15 篇 法学
- 13 篇 社会学
14 篇 经济学
- 14 篇 应用经济学
9 篇 文学
8 篇 教育学
6 篇 农学
1 篇 军事学

主题

109 篇 distributed comp...
79 篇 parallel process...
76 篇 distributed comp...
62 篇 cloud computing
51 篇 parallel computi...
44 篇 computational mo...
41 篇 parallel program...
39 篇 computer archite...
35 篇 distributed data...
34 篇 fault tolerance
29 篇 concurrent compu...
29 篇 middleware
28 篇 parallel algorit...
28 篇 mapreduce
28 篇 parallel process...
26 篇 resource managem...
25 篇 application soft...
25 篇 big data
24 篇 wireless sensor ...
24 篇 protocols

机构

14 篇 saint petersburg...
7 篇 chinese acad sci...
6 篇 univ adelaide sc...
6 篇 institute of com...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
5 篇 plekhanov russia...
4 篇 saint petersburg...
4 篇 harbin inst tech...
4 篇 meshcheryakov la...
4 篇 centre for distr...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 st petersburg st...
4 篇 science and tech...
3 篇 huazhong univ sc...
3 篇 joint institute ...
3 篇 king saud univer...
3 篇 department of co...
3 篇 university of el...

作者

17 篇 zomaya albert y.
11 篇 shen hong
10 篇 bogdanov alexand...
9 篇 korkhov vladimir
8 篇 degtyarev alexan...
8 篇 albert y. zomaya
6 篇 li y
6 篇 taheri javid
5 篇 dustdar schahram
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 kutovskiy nikola...
5 篇 nakayama shigeru
5 篇 huang z.
5 篇 sousa leonel
5 篇 gankevich ivan
5 篇 rothermel kurt
4 篇 jerzy waśniewski
4 篇 leung k.

语言

1,731 篇 英文
18 篇 中文
15 篇 其他
9 篇 俄文

检索条件"任意字段=9th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1772 条记录，以下是1731-1740 订阅

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

详细简洁

排序：

Efficient algorithms for resource allocation in distributed and parallel query processing environments

Efficient algorithms for resource allocation in distributed ...

引用

international conference on distributed computing Systems

作者： P. Liu Y. Kiyoki T. Masuda Institute of Information Sciences and Electronics University of Tsukuba Tsukuba Japan Department of Information Science University of Tokyo Tokyo Japan

Several effective algorithms are presented for the optimal allocation of computer resources in a proposed stream-oriented parallel-processing scheme for database operations. these algorithms can be utilized to obtain the optimal allocation of memory resources for every type of query in sequential-processing environments, parallel-processing environments with shared-memory multiprocessors, and distributed-processing environments. the computation complexities of the proposed algorithms are analyzed and used to clarify the effectiveness of those algorithms.< >

关键词： Resource management Query processing parallel processing Concurrent computing Computer networks Algorithm design and analysis distributed databases distributed processing Microprocessors Information science

来源：评论

学校读者我要写书评

暂无评论

Marionette: a system for parallel distributed programming using a master/slave model

Marionette: a system for parallel distributed programming us...

引用

international conference on distributed computing Systems

作者： M. Sullivan D. Anderson Computer Science Division Depamnent of Electrical Engineering and Computer Sciences University of California Berkeley CA USA

Marionette, a software package for distributed parallel programming in an environment of networked heterogeneous computer systems is described. It uses a master/slave model in which otherwise sequential application programmes can invoke worker operations (asynchronous remote procedure calls executed by slave processes) and context operations (updates to slaves' process states). the master and slaves also interact through shared data structures that can be modified only by the master. the Marionette runtime system is a heterogeneous remote procedure call package. It maintains the consistency of shared data structures, recovers transparently from slave processor failure, and assigns operations to slaves. the Marionette system includes tools for debugging, automated compilation of program binaries for multiple architectures, and distributing binaries to remote file systems. Measurements of a UNIX-based implementation to Marionette and a parallel ray-tracing renderer are presented.< >

关键词： parallel programming Master-slave Data structures Software packages Computer networks Concurrent computing distributed computing Context modeling Application software Packaging

来源：评论

学校读者我要写书评

暂无评论

HPC/VORX: a local area multicomputer system

HPC/VORX: a local area multicomputer system

引用

international conference on distributed computing Systems

作者： R.D. Gaglianello B.S. Robinson T.L. Lindstrom E.E. Sampieri AT and T Bell Laboratories Holmdel NJ USA AT&T Bell Labaratories Holmdel NJ USA

A system is described that combines the major strengths of local area networks and multicomputers, namely resource sharing over geographically significant distances and small communication latencies. the result is a new architecture called a local area multicomputer (LAM). the system that is described attempts to solve the seemingly incompatible needs of the two application domains by utilizing a high-capacity, low-latency interconnection network called the HPC supported by the VORX multiprocessor computing environment. For systems with hundreds of nodes, the network capacity is in the Gb/s range, and the latency for small messages is about 10 mu s. the HPC can connect resources located several kilometers apart. the VORX environment provides the necessary program development tools and resource management functions needed to experiment with distributed applications. Two applications are outlined to show the diverse uses for a LAM system and the status of an 80-node system that includes 70 adjunct processors and ten SUN 3 workstations/fileservers.< >

关键词： Workstations Delay Application software Resource management Computer architecture Local area networks parallel processing Multiprocessor interconnection networks Computer networks Sun

来源：评论

学校读者我要写书评

暂无评论

Performance of a decentralized knowledge base system

Performance of a decentralized knowledge base system

引用

international conference on distributed computing Systems

作者： C. Lee L. Bic Department of Information and Computer Science University of California Irvine USA

the binary predicate execution model (BPEM) is a computational model that combines logic programming, semantic nets, and message-driven computation into a paradigm for the construction of highly parallel knowledge-base systems. Simulation results are presented that demonstrate the ability of BPM to exploit effectively the resources of a loosely coupled computer network consisting of large numbers of independent processing elements. these simulations suggest performance on the order of 10/sup 5/ logical inferences per second for 256 processing elements in an n-cube configuration. A very important feature of the BPEM is that it scales-up linearly under simple OR-parallelism and AND-parallelism. Hence, the BPEM can scale-up to exploit parallelism efficiently in very large semantic networks and knowledge bases.< >

关键词： Object oriented modeling Computational modeling Logic programming Computer networks Concurrent computing Computer science Computer simulation parallel processing Data mining distributed computing

来源：评论

学校读者我要写书评

暂无评论

Performance modeling of the modified mesh-connected parallel computer

Performance modeling of the modified mesh-connected parallel...

引用

international conference on distributed computing Systems

作者： C.J. Wang V.P. Nelson C.H. Wu Elec.& Comp. Engineering Department University of Colorado Colorado Springs CO USA Elec. Engineering Department Aubum University Auburn AL USA

A message-passing computer architecture called the modified mesh-connected parallel computer (MMCPC) is proposed and studied. the MMCPC is designed to be general-purpose parallel architecture suitable for wafer-scale integration. Generalized stochastic Petri nets (GSPNs) are used to model the behavior of the MMCPC. the GSPN performance modeling results show a need for a new processing element (PE). A PE architecture, able to handle data processing and message passing concurrently, is proposed, and the silicon overhead is estimated in comparison with transputerlike PEs. Based on the proposed PE, optimum sizes of the MMCPC for different program structures are derived. A two-dimensional fast Fourier transform problem is used as an example to demonstrate that the MMCPC is a cost-effective performance-enhancement architecture to a real problem.< >

关键词： Semiconductor device modeling Computer architecture Concurrent computing parallel architectures Wafer scale integration Stochastic processes Petri nets Data processing Message passing Silicon

来源：评论

学校读者我要写书评

暂无评论

Evaluation of concurrent pools

Evaluation of concurrent pools

引用

international conference on distributed computing Systems

作者： D. Kotz C.S. Ellis Department of Computer Science Duke University Durham NC USA

Performance considerations affecting the design of a mechanism that preserves locality and avoids high-latency remote references called the concurrent pools data structure are explored. the effectiveness of three different implementations of concurrent pools is evaluated. Experiments performed on a BBN Butterfly multiprocessor under a variety of workloads shown that the three implementations perform similarly well for light workloads, but that with stressful workloads it appears that a simple algorithm can provide better performance than a complex algorithm, designed to keep remote accesses to a minimum. Implementations can benefit by taking into account information on the nature of the operations performed by each process to help balance the elements among processes that need them.< >

关键词： Data structures Concrete Computer science parallel programming Concurrent computing distributed computing Interference Local area networks Algorithm design and analysis Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Programming the twisted-cube architectures

Programming the twisted-cube architectures

引用

international conference on distributed computing Systems

作者： K. Efe The Center for Advanced Computer Studies University of Southwestern Louisiana Lafayette LA USA

A network is proposed that preserves all of the properties of the hypercube, but has a diameter which is only about half of that of the hypercube. this network is self-routing, in the sense that there is a simple distributed routing algorithm which guarantees optimal paths between any pair of vertices. this fact, together with other properties such as regularity, symmetry, high connectivity, and a simple recursive structure, implies that the multiply twisted cube is an alternative to the ordinary hypercube for massively parallel architectures. Single-input multiple-data stream algorithm were developed which utilize the new architecture. the multiply-twisted hypercube architecture can be used to profitably emulate the ordinary hypercube. Some of the basic properties of this network are discussed, the programming issues are emphasized, and it is shown that any hypercube algorithm can be mapped to run on the new architecture. In many cases this mapping results in a substantial reduction in the running time due to more efficient routing of data between processors.< >

关键词： Hypercubes Concurrent computing Network topology Computer architecture parallel architectures Routing Computer networks Delay Terminology

来源：评论

学校读者我要写书评

暂无评论

A shared dataspace model of concurrency-language and programming implications

A shared dataspace model of concurrency-language and program...

引用

international conference on distributed computing Systems

作者： G.-C. Roman H.C. Cunningham Department of Computer Science Washington University Saint Louis MO USA

A language paradigm called shared dataspace is defined that causes computations to be performed using an anonymous, content-addressable communication medium acted upon by atomic transactions. To probe the essence of this paradigm, a relatively simple shared dataspace language called Swarm is defined. An overview is presented of the Swarm language. A formal operational model for the language is given and some of the programming implications and distinctive features of the model and language are discussed. Swarm programming strategies are examined using a series of related example programs.< >

关键词： Concurrent computing Data structures Computer science Vehicles Computer languages Technology management parallel processing Logic programming Knowledge based systems Database languages

来源：评论

学校读者我要写书评

暂无评论

Reliable distributed sorting through the application-oriented fault tolerance paradigm

Reliable distributed sorting through the application-oriente...

引用

international conference on distributed computing Systems

作者： B.M. McMillin L.M. Ni Computer Science Department University of Missouri Rolla Rolla MO USA Department of Computer Science Michigan State University East Lansing MI USA

the design and implementation of a reliable version of the distributed bitonic sorting algorithm using the application-oriented fault tolerance paradigm on a commercial multicomputer is described. Sorting assertions in general are discussed and the bitonic sort algorithm is introduced. Faulty behavior is discussed and a fault-tolerant parallel bitonic sort developed using this paradigm is presented. the error coverage and the response of the fault-tolerant algorithm to faulty behavior are presented. Both asymptotic complexity and the results of run-time experimental measurements on an Ncube multicomputer are given. the authors demonstrate that the application-oriented fault tolerance paradigm is applicable to problems of a noniterative nature.< >

关键词： Sorting Fault tolerance Testing Fault detection Hardware Peer to peer computing Algorithm design and analysis Computer science Application software Software algorithms

来源：评论

学校读者我要写书评

暂无评论

A flexible algorithm for replicated directory management

A flexible algorithm for replicated directory management

引用

international conference on distributed computing Systems

作者： S. Sarin R. Floyd N. Phadnis Xerox Advanced Information Technology Four Cambridge Center Cambridge MA USA BBN Systems and Technologies Corporation Cambridge MA USA

A replicated directory management algorithm is presented that supports full location-transparency by allowing migration and reconfiguration at the granularity of individual names. Initially, all names in a directory (including names not yet in use) are controlled by the same set of sites, but control over any individual name (or range of names) can be migrated, e.g. to the set of sites that control the data object associated with the name. the method is based on a directory replication algorithm of J.J. Bloch et al. (1987), incorporating two extensions: (1) allowing control over individual names in a directory to migrate independently; and (2) allowing the definition of relationships among names, such that if control over a given name migrates, then those names that depend on it are automatically migrated as well. Finally, it is stated that the major cost of the algorithm, compared to simpler approaches that do not provide the same degree of location transparency, is the additional complexity and difficulty of obtaining a consistent view of the entire directory.< >

关键词： distributed computing File systems Database systems Automatic control Technology management Information technology Contracts Control systems Partitioning algorithms Voting

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共178页 << < 169 170 171 172 173 174 175 176 177 178 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：