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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是651-660 订阅

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

详细简洁

排序：

Dual of a complete graph as an interconnection network

Dual of a complete graph as an interconnection network

引用

International symposium on parallel and distributed processing (IPDPS)

作者： S.Q. Zheng Jie Wu Department of Computer Science Louisiana State University Baton Rouge LA USA Department of Electrical & Computer Engineering Florida Atlantic University Boca Raton FL USA

A new class of interconnection networks, called hypernetworks, was proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they allow for increased resource-sharing and communication bandwidth utilization, and they are especially suitable for optical interconnects. the authors propose a scheme for deriving new hypernetworks using hypergraph duals. As an example, they investigate the dual, K/sub n/*, of the n-vertex complete graph K/sub n/, and show that it has many desirable properties. they also present a set of fundamental data communication algorithms for K/sub n/*. their results indicate that the K/sub n/* hypernetwork is a useful and promising interconnection structure for high-performance parallel and distributed competing systems.

关键词： Multiprocessor interconnection networks Optical interconnections Wire Optical devices Optical receivers distributed computing Delay High speed optical techniques Optical crosstalk Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Fast deterministic sorting on large parallel machines

Fast deterministic sorting on large parallel machines

引用

International symposium on parallel and distributed processing (IPDPS)

作者： T. Dachraoui L. Narayanan Department of Computer Science Concordia University Montreal QUE Canada

Many sorting algorithms that perform well on uniformly distributed data suffer significant performance degradation on non-random data. Unfortunately many real-world applications require sorting on data that is not uniformly distributed. In this paper we consider distributions of varying entropies. We describe A-Ranksort, a new sorting algorithm for parallel machines, whose behavior on input distributions of different entropies is relatively stable. Our algorithm is based on a deterministic strategy to find approximate ranks for all keys. We implemented A-Ranksort, B-Flashsort, Radixsort, and Bitonic sort on a 2048 processor Maspar MP-1. Our experiments show that A-Ranksort out-performs all the other algorithms on a variety of input distributions, when the output is required to be balanced. We are also able to provide bounds on the average-case and worst-case complexities of our algorithm, in terms of the costs of some chosen primitive operations. the predicted performance is very close to the empirical results, thus justifying our model.

关键词： Sorting parallel machines Algorithm design and analysis Computer science Application software Entropy Costs Predictive models Concurrent computing Topology

来源：评论

学校读者我要写书评

暂无评论

Improving the parallelism and concurrency in decoupled architectures

Improving the parallelism and concurrency in decoupled archi...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： L. John R. Radhakrisnan Electrical and Computer Engineering University of Texas Austin Austin TX USA

Concurrency between access and execution has been exploited by queues in many decoupled access-execute architectures, but data dependent control dependencies often prohibit prefetching of data to queues. this paper investigates a technique to facilitate anticipatory loading to queues even in presence of data dependent control dependencies. the proposed method consists of fetching along one or both paths of a data dependent control dependency and inserting consume instructions in appropriate paths to consume the unnecessarily fetched data. the compiler hoists load instructions above control dependencies as in conventional load hoisting techniques. the technique is seen to be very effective in programs with data dependent if-then-else's. We also present an architecture with multiple access units, the mLSU architecture, which parallelizes the access process. Simulation experiments illustrate that multiple access units improve the performance if access processor instruction issue is a bottleneck.

关键词： Concurrent computing Computer architecture Processor scheduling Dynamic scheduling parallel processing Buffer storage Computer aided instruction Computer applications Pipelines Prefetching

来源：评论

学校读者我要写书评

暂无评论

Improved algorithms and data structures for solving graph problems in external memory

Improved algorithms and data structures for solving graph pr...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： V. Kumar E.J. Schwabe Department of EECS Northwestern University Evanston IL USA

Recently, the study of I/O-efficient algorithms has moved beyond fundamental problems of sorting and permuting and into wider areas such as computational geometry and graph algorithms. With this expansion has come a need for new algorithmic techniques and data structures. In this paper, we present I/O-efficient analogues of well-known data structures that we show to be useful for obtaining simpler and improved algorithms for several graph problems. Our results include improved algorithms for minimum spanning trees, breadth-first search, and single-source shortest paths. the descriptions of these algorithms are greatly simplified by their use of well-defined I/O-efficient data structures with good amortized performance bounds. We expect that I/O efficient data structures such as these will be a useful tool for the design-of I/O-efficient algorithms.

关键词： Data structures parallel processing Read-write memory Sorting Computational geometry Tree graphs Algorithm design and analysis throughput Pressing Communication networks

来源：评论

学校读者我要写书评

暂无评论

Measurement and simulation based performance analysis of parallel I/O in a high-performance cluster system

Measurement and simulation based performance analysis of par...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： C. Natarajan R.K. Iyer Coordinated Science Laboratory University of Illinois Urbana-Champaign Urbana IL USA

this paper presents a measurement and simulation based study of parallel I/O in a high-performance cluster system: the Pittsburgh Supercomputing Center (PSC) DEC Alpha Supercluster. the measurements were used to characterize the performance bottlenecks and the throughput limits at the compute and I/O nodes, and to provide realistic input parameters to PioSim, a simulation environment we have developed to investigate parallel I/O performance issues in cluster systems. PioSim was used to obtain a detailed characterization of parallel I/O performance, in the high performance cluster system, for different regular access patterns and different system configurations. this paper also explores the use of local disks at the compute nodes for parallel I/O, and finds that the local disk architecture outperforms the traditional parallel I/O over remote I/O node disks architecture, even when as much as 68-75% of the requests from each compute node goes to remote disks.

关键词： Analytical models Performance analysis Concurrent computing Computer architecture Computational modeling throughput File systems Coordinate measuring machines High performance computing System performance

来源：评论

学校读者我要写书评

暂无评论

A loop allocation policy for DOACROSS loops

A loop allocation policy for DOACROSS loops

引用

International symposium on parallel and distributed processing (IPDPS)

作者： J.T. Lim A.R. Hurson K. Kavi B. Lee Computer Science and Engineering Department Pennsylvania State University University Park PA USA Computer Science and Engineering Department University of Texas Arlington Arlington TX USA Department of Electrical and Computer Engineering Oregon State University Corvallis OR USA

the dataflow model of computation, in general, and its recent direction to combine dataflow processing with control-flow processing, in particular, provide attractive alternatives to satisfy the computational demands of new applications, without experiencing the shortcomings of the traditional concurrent systems. this should motivate researchers to analyze the applicability of familiar concepts, such as scheduling and load balancing, within this new architectural framework. Effective execution of loop iterations as a means to improve performance and hardware utilization has received a great deal of attention in the past. In this paper we address the problem of scheduling/allocation of DOACROSS loops in a multithreaded dataflow environment. An extension to the staggered scheme-Cyclic staggered scheme-which produces a more balanced distribution of iterations among processors is introduced and its performance improvement in a dataflow and control-flow environment is simulated and analyzed.

关键词： Yarn parallel processing Delay Computational modeling Concurrent computing Job shop scheduling Processor scheduling Process control Hardware Switches

来源：评论

学校读者我要写书评

暂无评论

An efficient file transmission algorithm for distributed computing systems

An efficient file transmission algorithm for distributed com...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： D.J. Chen P.Y. Chang Y.W. Lee Computer Science and Information Engineering Department National Chiao Tung University Hsinchu Taiwan

In a distributed system, executing a program often requires the access of remote data files. An efficient data transmission strategy is thus important for real-time applications. Since data files may be replicated and their locations are transparent to the executed program, it becomes the system's responsibility to select a proper file server such that data can be transmitted in an effective way. We consider the scenario that a particular program needs several data files simultaneously for its execution. Each data file may have replicas across the network. the problem is how to find a collection of file servers and the routing paths such that the data transmission time is minimum. An exhaustive approach could of course find the optimal solution. However, it pays a high computation price. We thus propose a heuristic method. Results obtained from the proposed method are encouraging.

关键词： distributed computing File servers Routing Application software Delay Data communication Military computing Linear programming Joining processes Computer science

来源：评论

学校读者我要写书评

暂无评论

A heterogeneous hierarchical solution to cost-efficient high performance computing

A heterogeneous hierarchical solution to cost-efficient high...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： Z.B. Miled J.A.B. Fortes Sch. of Electr. & Comput. Eng. Purdue Univ. West Lafayette IN USA School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

Two facts that suggest the desirability of a hierarchical approach to cost-effective high-performance computing are empirically established in this paper. the first fact is the temporal locality of programs with respect to the degree of parallelism. Two temporal (instruction and data) locality principles are identified and empirically established for a set of programs. the impact of this behavior is discussed with respect to the proposed heterogeneous multilevel architecture. the second fact that supports the hierarchical architecture is the cost-efficiency advantage of heterogeneous over homogeneous multiprocessor systems. An initial performance analysis is presented which quantifies this fact for the proposed heterogeneous hierarchical organization. the proposed multilevel processor configuration uses fast and costly resources sparingly to reduce sequential and low parallelism bottlenecks. the resulting organization tries to balance cost, speed and parallelism granularity.

关键词： High performance computing parallel processing Concurrent computing Costs Bridges Multiprocessing systems Research and development Application software Computer applications Environmental economics

来源：评论

学校读者我要写书评

暂无评论

An efficient implementation of tree-based multicast routing for distributed shared-memory multiprocessors

An efficient implementation of tree-based multicast routing ...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： M.P. Malumbres J. Duato J. Torrellas Departamento DISCA Universidad Politècnica de Valencia Valencia Spain CSRD University of Illinois Urbana-Champaign Urbana IL USA

this paper presents an efficient routing and flow control mechanism to implement multidestination message passing in wormhole networks. It is targeted to situations where the size of message data is very small, like in invalidation and update messages in distributed shared-memory multiprocessors (DSMs) with hardware cache coherence. the mechanism is a variation of tree-based multicast with pruning to avoid deadlocks. the new scheme does not require that the destination addresses in a given multicast message be ordered, thereby avoiding any ordering overhead. It allows messages to use any deadlock-free routing function and only requires one startup for each multicast message. the new scheme has been evaluated on several k-ary n-cube networks under synthetic loads. the results show that the proposed scheme is faster than other multicast mechanisms when the multicast traffic is composed of short messages.

关键词： Routing System recovery Multicast algorithms Message passing Multicast communication Algorithm design and analysis Broadcasting Multicast protocols Delay Unicast

来源：评论

学校读者我要写书评

暂无评论

A framework for automatic dynamic data mapping

A framework for automatic dynamic data mapping

引用

International symposium on parallel and distributed processing (IPDPS)

作者： J. Garcia E. Ayguade J. Labarta Computer Architecture Department Universitat Poliltècnica de Catalunya Barcelona Spain

Physically-distributed memory multiprocessors are becoming popular and data distribution and loop parallelization are aspects that a parallelizing compiler has to consider in order to get efficiency from the system. the cost of accessing local and remote data can be one or several orders of magnitude different, and this can dramatically affect the performance of the system. It would be desirable to free the programmer from considerations of the low-level details of the target architecture, to program explicit processes or specify interprocess communication. We present an approach to automatically derive static or dynamic data distribution strategies for the arrays used in a program. All the information required about data movement and parallelism is contained in a single data structure, called the Communication-parallelism Graph (CPG). the problem is modeled and solved using a general purpose linear 0-1 integer programming solver. this allows us to find the optimal solution for the problem for one-dimensional array distributions. We also show the feasibility of using this approach in terms of compilation time and quality of the solutions generated.

关键词： Phased arrays Costs Distribution strategy Data structures distributed computing Computer architecture Chromium Programming profession Tail Ear

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：