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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

829 篇 会议
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

669 篇 工学
- 634 篇 计算机科学与技术...
- 299 篇 软件工程
- 107 篇 信息与通信工程
- 95 篇 电气工程
- 49 篇 控制科学与工程
- 32 篇 电子科学与技术（可...
- 11 篇 机械工程
- 7 篇 生物医学工程（可授...
- 6 篇 仪器科学与技术
- 5 篇 动力工程及工程热...
- 4 篇 建筑学
- 4 篇 生物工程
- 3 篇 力学（可授工学、理...
- 3 篇 冶金工程
- 3 篇 土木工程
- 3 篇 网络空间安全
155 篇 理学
- 132 篇 数学
- 20 篇 统计学（可授理学、...
- 16 篇 物理学
- 10 篇 系统科学
- 5 篇 化学
- 4 篇 生物学
52 篇 管理学
- 46 篇 管理科学与工程(可...
- 17 篇 工商管理
- 10 篇 图书情报与档案管...
8 篇 医学
- 5 篇 临床医学
- 3 篇 特种医学
5 篇 法学
- 4 篇 社会学
- 2 篇 法学
3 篇 经济学
- 3 篇 应用经济学
1 篇 教育学
1 篇 农学
1 篇 军事学

主题

170 篇 parallel process...
77 篇 parallel process...
55 篇 concurrent compu...
43 篇 distributed comp...
42 篇 computer science
41 篇 distributed comp...
36 篇 parallel algorit...
32 篇 computer archite...
29 篇 hardware
28 篇 application soft...
28 篇 computational mo...
24 篇 costs
24 篇 algorithm design...
23 篇 parallel program...
23 篇 delay
19 篇 processor schedu...
18 篇 parallel archite...
18 篇 computer network...
16 篇 partitioning alg...
15 篇 high performance...

机构

5 篇 natl univ def te...
4 篇 univ of central ...
3 篇 oak ridge natl l...
3 篇 california inst ...
3 篇 syracuse univ sy...
3 篇 beijing univ pos...
3 篇 new jersey inst ...
3 篇 inner mongolia u...
3 篇 univ of maryland...
3 篇 univ of illinois...
3 篇 ohio state univ ...
3 篇 natl univ def te...
2 篇 natl univ def te...
2 篇 college of compu...
2 篇 univ texas austi...
2 篇 natl univ irelan...
2 篇 washington state...
2 篇 concordia univ m...
2 篇 lipn
2 篇 school of comput...

作者

4 篇 kale laxmikant v...
4 篇 prasanna viktor ...
4 篇 rothermel kurt
3 篇 yuxing peng
3 篇 yao wenbin
3 篇 mi haibo
3 篇 haibo mi
3 篇 mcloone s
3 篇 liu jie
3 篇 sohn andrew
3 篇 wang yijie
3 篇 tang yuxing
3 篇 ward t
3 篇 boukerche a
3 篇 sato mitsuhisa
3 篇 das sajal k.
3 篇 li xiaoyong
3 篇 siegel howard ja...
3 篇 delaney d
2 篇 boku taisuke

语言

831 篇 英文
3 篇 其他
1 篇 中文

检索条件"任意字段=8th IEEE Symposium on Parallel and Distributed Processing"

共 835 条记录，以下是641-650 订阅

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

详细简洁

排序：

Compile-time inter-query dependence analysis

Compile-time inter-query dependence analysis

引用

International symposium on parallel and distributed processing (IPDPS)

作者： S. Parthasarathy Wei Li M. Cierniak M.J. Zaki Department of Computer Science University of Rochester Rochester NY USA

Most parallel databases exploit two types of parallelism: intra-query parallelism and inter-transaction concurrency. Between these two cases lies another type of parallelism: inter-query parallelism within a transaction or application. Exploiting inter-query parallelism requires either compiler support to automatically parallelize the existing embedded query programs; or programming support to write explicitly parallel query programs. the authors present compiler analysis to automatically detect parallelism in the embedded query programs. they present compiler algorithms for detecting dependences in such programs. they show that the properties of some aggregate functions such as MIN and MAX can help reduce statically computed dependences.

关键词： parallel processing Program processors Testing Transaction databases Aggregates Database systems Concurrent computing Automatic programming parallel programming Computer science

来源：评论

学校读者我要写书评

暂无评论

Recursive hierarchical swapped networks: versatile interconnection architectures for highly parallel systems

Recursive hierarchical swapped networks: versatile interconn...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： Chi-Hsiang Yeh B. Parhami Department of Electrical and Computer Engineering University of California Santa Barbara CA USA

the authors propose a new class of interconnection networks called recursive hierarchical swapped networks (RHSN) for general-purpose parallel processing. the node degrees of RHSNs can vary from a small number to as large as required, depending on recursive and hierarchical composition parameters and the nucleus graph chosen. the diameter of an RHSN can be asymptotically optimal within a small constant factor. they present efficient routing, semigroup computation, ascend/descend, matrix-matrix multiplication, and emulation algorithms, thus proving the versatility of RHSNs. In particular on suitably constructed RHSNs, matrix multiplication can be performed faster than the DNS algorithm on a hypercube. Furthermore, ascend/descend algorithms, semigroup computation, and parallel prefix computation can be done using algorithms with asymptotically fewer communication steps than on a hypercube.

关键词： Joining processes Hypercubes Fault tolerance Multiprocessor interconnection networks

来源：评论

学校读者我要写书评

暂无评论

Optimistic parallel computation: an example from computational chemistry

Optimistic parallel computation: an example from computation...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： E.A. Crawford K. Schwan S. Yalamanchili School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta GA USA College of Computing Georgia Institute of Technology Atlanta GA USA

Performance penalties due to synchronization are a common concern in parallel programming. Traditional approaches enforce the correct ordering of write operations using locks, but this can be time-consuming and drastically reduce the benefits of using a parallel machine. Instead, for certain classes or programs we propose using an optimistic approach where the solution is calculated without any locks. this approach detects data races by maintaining statistics on memory writes and correcting potentially inappropriate data values by repeating selected computations and write operations. this scheme is evaluated with a novel parallel implementation of the Moller-Plesset perturbation theory energy calculation for closed-shell molecules.

关键词： Concurrent computing Frequency synchronization Hazards Orbital calculations Educational institutions parallel programming parallel machines Statistics Design optimization Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

A framework for modeling applications as distributed active objects

A framework for modeling applications as distributed active ...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： N. Pissinou K. Vanapipat K. Makki B.K. Rajashekhar E.K. Park B. Wong X. Jia University of Southwestern Louisiana USA Oracle Corporation Thailand University of Nevada Las Vegas USA Qualcomm Inc. San Diego USA United States Naval Academy USA DISA USA City University of Hong Kong Hong Kong China

this paper identifies a framework for modeling applications as distributed active objects, which can either be used to design a new active distributed multidatabase architecture or can be applied to an existing multidatabase architectural design to make it active. A system whose design follows a model such as the one proposed in this paper is referred to as an active multidatabase system, for it is equipped with mechanisms to detect and propagate anticipated changes as distributed active objects.

关键词： Monitoring distributed databases Object detection Object oriented modeling Database systems Safety NASA Event detection Object oriented databases Technology management

来源：评论

学校读者我要写书评

暂无评论

Implementing cooperative software with high-level communication packages

Implementing cooperative software with high-level communicat...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： A. Forst E. Kuhn Institute of Computer Languages University of Technology Vienna Vienna Austria

the use of appropriate tools is crucial for the development of robust and distributed software. the programming of heterogeneous environments is more demanding than programming single, stand-alone computers. We believe that client/server technology is not a satisfactory solution. Most problems do not naturally decompose into an asymmetric client/server structure. Better abstraction mechanisms are needed. We propose a new coordination framework that we have developed. It supports shared objects as reliable communication media, advanced transactions, and concurrency through processes that form reliable software contracts. For a discussion, we compare the realization of a typical distributed application, that belongs to the domain of cooperative work, with three different tools: our coordination framework; a representative of the classical client/server and message paradigm; and the Linda communication model.

关键词： Software packages Packaging Collaborative work Kernel Computer languages parallel programming Logic programming Appropriate technology Europe Robustness

来源：评论

学校读者我要写书评

暂无评论

Generalized parallel selection in sorted matrices

Generalized parallel selection in sorted matrices

引用

International symposium on parallel and distributed processing (IPDPS)

作者： Hong Shen School of Computing and Information Technology Griffith University Nathan QLD Australia

ISBN: (纸本)0818676833

this paper presents a parallel algorithm running in time O(log m log* m(log log m+log(n/m))) time on an EREW PRAM with O(m/(log m log* m)) processors for the problem of selection in an m/spl times/n matrix with sorted rows and columns, m/spl les/n. Our algorithm generalizes the result of Sarnath and He (1992) for selection in a sorted matrix of equal dimensions, and thus answers the open question they posted. the algorithm is work-optimal when n/spl ges/m log m, and near optimal within O(log log m) factor otherwise. We show that our algorithm can be generalized to solve the selection problem on a set of sorted matrices of arbitrary dimensions.

关键词： parallel algorithms Phase change random access memory Helium Symmetric matrices Concurrent computing Information technology Australia Computer science Upper bound

来源：评论

学校读者我要写书评

暂无评论

A bulk-synchronous parallel library implementation for the BBN butterfly GP1000

A bulk-synchronous parallel library implementation for the B...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： M.W. Goudreau E.D. Root Department of Computer Science University of Central Florida Orlando FL USA

One of the fundamental goals of parallel computing is to develop a framework that will support portable and efficient application programs. the Bulk-Synchronous parallel (BSP) model was proposed to help achieve this goal. the BSP model is intended to be a "unifying model"-it addresses both software and hardware issues by allowing theoretical analysis to coexist with practical physical implementations. For several years the BSP model has been supported mainly by theoretical results. Recent experiments, however, have begun to demonstrate the practicality of the model for real architectures running real applications. the goal of this paper is to describe the methodology used to construct an efficient BSP library on the BBN Butterfly GP1000. Our results are relevant for BSP library implementations on shared-memory systems in general and for NUMA (nonuniform m-memory-access) machines in particular.

关键词： Libraries Hardware Phase change random access memory Programming profession Application software parallel processing Computer architecture Automatic programming Computer science parallel programming

来源：评论

学校读者我要写书评

暂无评论

Extending functional languages with stateful computations

Extending functional languages with stateful computations

引用

International symposium on parallel and distributed processing (IPDPS)

作者： Yung-Syau Chen J.-L. Gaudiot Rockwell Semiconductor Systems Rockwell International Corporation Newport Beach CA USA Department of Electrical Engineering Systems University of Southern California Los Angeles CA USA

A new approach in which stateful computations can be performed within the framework of a functional programming language is presented. In most functional programming languages, programmers are unable to easily manipulate state-based computations which are not supported by functional languages. To solve this problem, the authors propose to extend the Sisal language with special user declared variables. this approach can greatly help users in writing programs, simplifying parallel compilation, and improving performance. Under this scheme, programmers are able to manipulate stateful computations. In the methodology, programmers are allowed to declare special variables, and the parallel threads can be identified according to the usage of special variables. When compared to "pure" functional languages, the extended Sisal has more expressive power due to the availability of stateful computations.

关键词： parallel processing Programming profession Power system modeling Computer languages Functional programming Writing Yarn Costs Computer architecture parallel languages

来源：评论

学校读者我要写书评

暂无评论

Last alternative optimization

Last alternative optimization

引用

International symposium on parallel and distributed processing (IPDPS)

作者： G. Gupta E. Pontelli Laboratory for Logicand Advanced Programming New Mexico State University Las Cruces NM USA

the authors present a new optimization for or-parallel logic programming (Prolog) systems, called last alternative optimization (LAO). the LAO follows from the flattening principle and the principle of duality of or-parallelism and and-parallelism. Originally LAO was conceived as the dual of last parallel call optimization, an optimization developed for and-parallel systems. LAO enables Prolog programs that have data-or parallelism to execute more efficiently. It also enables more efficient (parallel) execution of constraint logic programs over finite domains. LAO is a fairly general optimization and can be readily applied to virtually any parallel system that exploits nondeterminism (e.g., parallel search based artificial intelligence systems). Last alternative optimization has been implemented in the ACE parallel Prolog system. the performance results indeed prove the effectiveness of LAO. they present a second optimization based on the flattening principle, called balanced nesting optimization (BNO), that is related to LAO, and that also leads to reduction of parallel overhead.

关键词： Logic programming parallel processing parallel programming Tree data structures Laboratories Databases Artificial intelligence Application software Automatic programming

来源：评论

学校读者我要写书评

暂无评论

Scalable scheduling algorithm for distributed memory machines

Scalable scheduling algorithm for distributed memory machine...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： S. Darbha D.P. Agrawal ECE Department Rutgers University Piscataway NJ USA ECE Department North Carolina State University Raleigh NC USA

the problem of scheduling tasks onto distributed memory machines for obtaining an optimal schedule is an NP-complete problem. We present a scalable scheduling algorithm which can schedule the tasks of directed acyclic graphs (DAGs) with a complexity of O(V/sup 2/) in the worst case, where V is the number of nodes of the DAG. this algorithm generates an optimal schedule for a class of DAGs which satisfy certain conditions and if the required number of processors are available. the algorithm initially generates a schedule for a small number of processors. In case the available number of processors are higher than the number of processors required by the initial schedule, the algorithm scales the schedule appropriately in an effort to obtain a lower parallel time by utilizing the extra or idle processors. the algorithm has been applied to some practical DAGs and the results are very promising.

关键词： Scheduling algorithm Optimal scheduling Processor scheduling Clustering algorithms Partitioning algorithms NP-complete problem Contracts Costs Computational efficiency Equations

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共84页 << < 61 62 63 64 65 66 67 68 69 70 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：