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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,668 篇 会议
194 篇 期刊文献
25 册 图书

馆藏范围

4,887 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,499 篇 工学
- 2,385 篇 计算机科学与技术...
- 1,470 篇 软件工程
- 419 篇 信息与通信工程
- 385 篇 电气工程
- 193 篇 控制科学与工程
- 159 篇 电子科学与技术（可...
- 75 篇 网络空间安全
- 33 篇 材料科学与工程（可...
- 33 篇 生物医学工程（可授...
- 26 篇 机械工程
- 26 篇 安全科学与工程
- 21 篇 光学工程
- 21 篇 动力工程及工程热...
- 21 篇 生物工程
- 20 篇 建筑学
- 19 篇 土木工程
- 17 篇 力学（可授工学、理...
- 17 篇 环境科学与工程（可...
- 15 篇 交通运输工程
792 篇 理学
- 669 篇 数学
- 103 篇 统计学（可授理学、...
- 89 篇 系统科学
- 66 篇 物理学
- 29 篇 生物学
- 19 篇 化学
451 篇 管理学
- 322 篇 管理科学与工程(可...
- 229 篇 工商管理
- 153 篇 图书情报与档案管...
51 篇 经济学
- 51 篇 应用经济学
18 篇 法学
- 17 篇 社会学
15 篇 医学
9 篇 教育学
9 篇 农学
5 篇 文学
4 篇 军事学

主题

564 篇 distributed comp...
540 篇 computer science
490 篇 parallel process...
485 篇 concurrent compu...
410 篇 parallel process...
379 篇 application soft...
342 篇 distributed data...
335 篇 distributed comp...
310 篇 databases
288 篇 computer archite...
249 篇 database systems
222 篇 computational mo...
220 篇 delay
215 篇 hardware
211 篇 costs
188 篇 processor schedu...
172 篇 protocols
170 篇 computer network...
162 篇 large-scale syst...
152 篇 parallel program...

机构

20 篇 ibm thomas j. wa...
11 篇 department of co...
10 篇 department of co...
8 篇 school of comput...
8 篇 department of co...
8 篇 department of co...
7 篇 ieee
7 篇 department of co...
7 篇 department of ee...
7 篇 department of co...
7 篇 college of compu...
7 篇 hewlett packard ...
7 篇 northwestern uni...
6 篇 department of co...
6 篇 syracuse univ sy...
6 篇 department of co...
6 篇 department of co...
6 篇 lawrence berkele...
6 篇 college of compu...
6 篇 univ of californ...

作者

20 篇 a. choudhary
16 篇 a. boukerche
10 篇 s.k. das
10 篇 boukerche azzedi...
10 篇 choudhary a
10 篇 li keqin
9 篇 j. saltz
9 篇 sun xian-he
9 篇 choudhary alok
9 篇 k. schwan
9 篇 das sajal k.
8 篇 l.r. welch
8 篇 a. makinouchi
8 篇 chen haibo
8 篇 anon
8 篇 a.a. chien
7 篇 c. katsinis
7 篇 t. kurc
7 篇 d.k. panda
7 篇 keqin li

语言

4,874 篇 英文
11 篇 其他
2 篇 中文

检索条件"任意字段=Proceedings International Symposium on Databases in Parallel and Distributed Systems"

共 4887 条记录，以下是4641-4650 订阅

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

详细简洁

排序：

PMAC: an environment for parallel programming

PMAC: an environment for parallel programming

引用

international symposium on parallel Processing

作者： B. Dehbonei C. Laurent N. Tawbi R.S. Kulkarni Bull Corporate Research Center Louveciennes France PSI Data Systems Bangalore Karnataka India

Presents a parallel programming environment called PMACS. The central structure of this environment is the Parametrized Dependence Graph that gives a very precise representation of dependencies. It also facilitates the recompilation of dependencies whenever the user is requested to introduce information about the program. A unique framework for the interprocedural constant propagation and the interprocedural side-effect analysis, based on symbolic evaluation, is used. A powerful tool for displaying graphs has also been carried out. It allows the user to understand the detected inherent parallelism of his program. A first release of PMACS written in C is already implemented.< >

关键词： parallel programming Performance analysis Data analysis databases Information analysis Programming environments Collaborative tools parallel machines Data systems Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Analysis of the modified even networks

Analysis of the modified even networks

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： S.V.R. Madabhushi S. Lakshmivarahan S.K. Dhall Parallel Processing Institute School of Elecrical Engineering and Computer Science University of Oklahama Norman OK USA

The authors introduce a class of networks based on G/sup delta / graphs that are subgraphs of the binary hypercubes and even networks. For this class of networks, the authors present (a) complete characterization of the node disjoint (parallel) paths, (b) a strategy for tracing a Hamiltonian cycle in G/sup delta /, and (c) an optimal algorithm for single source broadcast of data packets using a greedy spanning tree.< >

关键词： Hypercubes Broadcasting Routing parallel processing Computer science Multiprocessor interconnection networks Binary trees Multidimensional systems Bipartite graph Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Reliability oriented allocation of files on distributed systems

Reliability oriented allocation of files on distributed syst...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： R.M. Pathak A. Kumar Y.P. Gupta Engineering Maths and Computer Science Department University of Louisville Louisville KY USA Department of Management University of Louisville Louisville KY USA

One of the important features of distributed computing systems (DCSs) is the potential of high reliability. When the hardware configuration of a DCS is fixed, the system reliability mainly depends on the allocation of various resources. One of the important resources used in a DCS are various files. The authors have developed a reliability oriented file allocation scheme for distributed systems. In this scheme various files are allocated to different nodes of a DCS such that the reliability of executing a program which requires files from remote nodes(s) is maximized. Several variations of this problem are solved to illustrate the genetic algorithm based solution approach. The paper also provides the relation between degree of redundancy of files and the maximum achievable reliability of executing a program.< >

关键词： distributed control Cost function Computer network reliability distributed computing Resource management Redundancy Delay Throughput Fault tolerance Computer science

来源：评论

学校读者我要写书评

暂无评论

CAT: an execution model for concurrent full text search

CAT: an execution model for concurrent full text search

引用

international Conference on parallel and distributed Information systems

作者： Zheng Lin Department of Computer Science University of Maryland College Park MD USA

An execution model based on concurrent frame signature file (CAT) is proposed for full text retrieval. The proposed method places emphasis on creating opportunities for concurrent access to the signature file, which resides on disks, without resorting to redundant storage. Thus, the advantage of low space overhead availed by signature file methods is retained, while the response time of retrieval is significantly improved when implemented on a multiprocessor with multiple disks. Performance of the proposed method is measured by analysis and experiment. Results from a simulation study on the BBN Butterfly TC2000 multiprocessor shows the speed of the proposed method is very promising in both relative and absolute terms.< >

关键词： databases Delay Computer science Educational institutions Performance analysis Explosions Computer worms Application software Software libraries Indexing

来源：评论

学校读者我要写书评

暂无评论

Performance of parallel spanning tree algorithms on linear arrays of transputers and Unix systems

Performance of parallel spanning tree algorithms on linear a...

引用

international symposium on parallel Processing

作者： S.K. Das Cui-Qing Yang Center for Research in Parallel and Distributed Computing Department of Computer Sciences University of North Texas Denton TX USA

This paper presents empirical performance of parallel algorithms for computing a spanning tree (SPT) and a minimum spanning tree (MST) of connected graphs on the Transputer and Unix systems, where processors are configured as a one-dimensional array. The parallel MST algorithm uses a weight matrix data structure; and three implementations of the SPT algorithm are presented with unordered edge-list, linked adjacency list and adjacency matrix as data structures. The experiments are conducted with a wide range of random graphs, generated for various edge-densities (d) for a given number (n) of vertices. The edge-density is varied between 0.1 and 0.9, and the maximum number of vertices (or edges) considered are 300 (or 40000) and 500 (or 110000) for transputer and Unix systems, respectively. A maximum speed-up of 2.98 is achieved on the transputer network of eight processors, and that for the Unix system is 3.0 with four processors.< >

关键词： Tree graphs Concurrent computing distributed computing parallel algorithms Tree data structures Data structures Random number generation Communication networks Clocks Very large scale integration

来源：评论

学校读者我要写书评

暂无评论

Fast parallel algorithms for solving triangular systems of linear equations on the hypercube

Fast parallel algorithms for solving triangular systems of l...

引用

international symposium on parallel Processing

作者： O.H. Ibarra M.H. Kim Department of Computer Science University of California Santa Barbara CA USA

Presents efficient hypercube algorithms for solving triangular systems of linear equations by using various matrix partitioning and mapping schemes. Recently, several parallel algorithms have been developed for this problem. In these algorithms, the triangular solver is treated as the second stage of Gauss elimination. Thus, the triangular matrix is distributed by columns (or rows) in a wrap fashion since it is likely that the matrix is distributed this way after an LU decomposition has been done on the matrix. However, the efficiency of the algorithms is low. The motivation here is to develop various data partitioning and mapping schemes for hypercube algorithms by treating the triangular solver as an independent problem. Performance of the algorithms is analyzed theoretically and empirically by implementing them on a commercially available hypercube.< >

关键词： parallel algorithms Equations Hypercubes Partitioning algorithms Matrix decomposition Concurrent computing Gaussian processes Computer science Performance analysis Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

parallel I/O subsystems for distributed-memory multicomputers

Parallel I/O subsystems for distributed-memory multicomputer...

引用

international symposium on parallel Processing

作者： J. Ghosh B. Agarwal Department of Electrical and Computer Engineering University of Technology Austin TX USA

The authors study the improvement in performance obtained in distributed memory machines through the use of a separate network that serves multiple I/O nodes operating under a distributed file system. For a hypercube architecture augmented by an independent I/O network that scales as N/log N, a significant improvement in performance is observed, specially when data locality is low. Moreover, performance becomes relatively insensitive to data locality. From the hardware aspect, wormhole routing is efficient only for low network loads, and its performance degrades rapidly even with moderate channel utilisation. Simulation results are presented for a 128-node hypercube.< >

关键词： Hypercubes Computer architecture Multiprocessor interconnection networks Routing File systems Hardware Degradation Computational modeling Added delay Joining processes

来源：评论

学校读者我要写书评

暂无评论

Comparative performance of parallel join algorithms

Comparative performance of parallel join algorithms

引用

international Conference on parallel and distributed Information systems

作者： J.L. Wolf D.M. Dias P.S. Yu J. Turek IBM Thomas J. Watson Research Center Yorktown Heights NY USA

The authors recently (1990, 1991) described two new join algorithms designed to address the data skew problem. These algorithms were based, respectively, on the traditional sort merge and hash join algorithms, and employed techniques borrowed from mathematical optimization theory. The current paper proposes significant improvements to both algorithms, increasing their effectiveness while simultaneously decreasing their execution times. It then focuses on the comparative performance of the improved algorithms and their more conventional sort merge and hash counterparts. The latter two are perfectly good algorithms except that they fail to deal with data skew. Both I/O- and CPU-bound configurations were examined. The new algorithms outperform their more conventional counterparts in the presence of just about any skew at all, dramatically so in cases of high skew.< >

关键词： Algorithm design and analysis Load management Relational databases parallel algorithms Partitioning algorithms parallel processing Robustness parallel architectures Filters Costs

来源：评论

学校读者我要写书评

暂无评论

Reliagram-a communication abstraction for distributed processing

Reliagram-a communication abstraction for distributed proces...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： R. Yavatkar V. Dumasia Department of Computer Science University of Kentucky Lexington KY USA

The authors have designed and implemented an efficient transport-level protocol called reliagram transport protocol (RGP) that provides a connectionless communication abstraction called reliagram. A reliagram represents a message that can be reliably and asynchronously sent and received by the RGP applications. Novel features of RGP include explicit transfer of transport-level state information to the application layer, rate-based transmission control, and a selective retransmission strategy. A prototype implementation shows that RGP provides superior performance as compared to UDP and thus can serve as a basis for building distributed programming systems.< >

关键词： distributed processing Transport protocols Communication system control Computational modeling Manufacturing automation Master-slave Computer science Prototypes distributed computing distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Compiling functional languages for SIMD architectures

Compiling functional languages for SIMD architectures

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： G.K. Jouret Department of Computing Imperial College of Science Technology and Medicine London UK

A major impediment to the wider proliferation of Single-Instruction, Multiple Datastream (SIMD) (3) architectures rests in the unsuitability of sequential, scalar, languages for programming data-parallel systems. Existing languages lack sufficient expressive power to describe data-parallel computation. A functional language, extended with data-parallel primitives, provides a powerful abstraction of the capabilities of SIMD architectures. Such a language conveys the following benefits: greater expressive power, a rich set of data-types, transparent access to data-parallelism, amenability to program transformation and consistency with the functional style. A compilation strategy onto an abstract SIMD architecture is presented.< >

关键词： Computer architecture Aggregates Central Processing Unit Runtime parallel processing Calculus Educational institutions Impedance Vehicles Technological innovation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共489页 << < 461 462 463 464 465 466 467 468 469 470 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：