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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A scalable method for predicting network performance in heterogeneous clusters

A scalable method for predicting network performance in hete...

引用

8th International symposium on parallel Architectures, Algorithms and Networks, I-SPAN 2005

作者： Katramatos, Dimitrios Chapin, Steve J. Department of Computer Science University of Virginia Charlottesville VA 22903 United States Department of Electrical Engineering and Computer Science Syracuse University Syracuse NY 13244 United States Brookhaven National Laboratory United States

ISBN: (纸本)0769525091

An important requirement for the effective scheduling of parallel applications on large heterogeneous clusters is a current view of system resource availability. Maintaining such a view is a time consuming problem, potentially O(N2). Although CPU availability is relatively easy to monitor, interconnecting network bandwidth varies not only with network topology, but also with message size and even with respect to the load of the communicating nodes. this paper describes a method for predicting a cluster's network performance for the purpose of scheduling parallel applications. the method generates a cluster-specific network model which can predict the latency of communications between any pair of nodes in linear time and under any computational and/or communication load conditions. the paper also presents the models generated for the Centurion cluster at the University of Virginia and the Orange Grove cluster at Syracuse University. A study of the prediction accuracy of the method under various load conditions by comparison to experimental measurements indicates an average prediction error of approximately 5% with the maximum encountered prediction error of less than 9%. © 2005 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

parallel benchmarks on the Transtech Paramid

Parallel benchmarks on the Transtech Paramid

引用

International symposium on parallel processing

作者： R.S. Stephens Transtech Parallel Systems Corporation Ithaca NY USA

this paper presents the results of running the some benchmarks from the Genesis suite on the Transtech Paramid. the benchmarks use the PARMACS parallel processing standard, and are based on applications in the fields of general relativity, molecular dynamics and QCD. the Paramid is a distributed memory parallel computer, using up to 64 Intel i860-XP processors. the results demonstrate good parallel performance, and the ability of the machine to run standard portable software.< >

关键词： Workstations Bandwidth Application software Concurrent computing distributed computing Supercomputers Hardware Switches Kernel parallel processing

来源：评论

学校读者我要写书评

暂无评论

Impact of load balancing on unstructured adaptive grid computations for distributed-memory multiprocessors

Impact of load balancing on unstructured adaptive grid compu...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： A. Sohm R. Biswas H.D. Simon Dept. of Comput. & Inf. Sci. New Jersey Inst. of Technol. Newark NJ USA RIACS NASA Ames Research Center Moffett Field CA USA NERSC Lawrence Berkeley National Laboratory Berkeley CA USA

the computational requirements for an adaptive solution of unsteady problems change as the simulation progresses. this causes workload imbalance among processors on a parallel machine which, in turn, requires significant data movement at runtime. We present a new dynamic load-balancing framework, called JOVE, that balances the workload across all processors with a global view. Whenever the computational mesh is adapted, JOVE is activated to eliminate the load imbalance. JOVE has been implemented on an IBM SP2 distributed-memory machine in MPI for portability. Experimental results for two model meshes demonstrate that mesh adaption with load balancing gives more than a sixfold improvement over one without load balancing. We also show that JOVE gives a 24-fold speedup on 64 processors compared to sequential execution.

关键词： Load management distributed computing Grid computing Runtime Computational fluid dynamics Computational modeling Computational Intelligence Society Space technology NASA Laboratories

来源：评论

学校读者我要写书评

暂无评论

Rejuvenation and failure detection in partitionable systems

Rejuvenation and failure detection in partitionable systems

引用

8th Pacific Rim International symposium on Dependable Computing (PRDC 2001)

作者： Fetzer, C Högstedt, K AT&T Labs Res Florham Pk NJ 07932 USA

ISBN: (纸本)0769514146

Certain gateways (e.g., some cable or DSL modems) are known to have low reliability and low availability. Most failures of these devices can however be "fixed" by rejuvenating the device after a failure has been detected. Such a detection based rejuvenation strategy permits increasing the availability of these gateways. In the considered scenario, rejuvenation is non-trivial since a failure of such a gateway will leave it partitioned away from the network. In particular, network operators that want to rejuvenate these gateways are in a different network partition, and can therefore not initiate a remote rejuvenation. In this paper we propose a failure detection based rejuvenation service and a remote detection service. the rejuvenation service detects and fixes "soft" failures automatically (in one partition), and the detection service detects (in another partition) all rejuvenations exactly once. within a bounded amount of time, even when the gateway is rejuvenated consecutively. the detection service also allows the detection of "hard" failures, and filtering of notifications of soft failures.

关键词： failure detection failure detection based rejuvenation distributed systems fault-tolerant systems home networking remote system management

来源：评论

学校读者我要写书评

暂无评论

distributed Resource Management and Matching in Sensor Networks

Distributed Resource Management and Matching in Sensor Netwo...

引用

8th International symposium on Information processing Sensor Networks

作者： Gao, Jie Guibas, Leonidas Milosavljevic, Nikola Zhou, Dengpan SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA Stanford Univ Dept Comp Sci Stanford CA 94305 USA

ISBN: (纸本)9781424451081

We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over time, events (fires, crime reports, cars looking for parking) arise one-by-one at arbitrary nodes, and need to be quickly matched to and serviced by an appropriate nearby resource, without knowledge of future requests, and without the ability to alter any decision once it has been made. We develop distributed algorithms to direct available resources in the network to these events (or vice versa) in a coordinated fashion, so that no two resources are assigned to the same event, and the total distance of the events from their matched resources is minimized. the key idea is to extract, in a preprocessing. stage, a well-separated tree metric that approximates the original network metric by a logarithmic distortion, allowing greedy matching algorithms to generate close to optimal matchings, and enabling communication-efficient probing-based algorithms for events to detect nearby available resources. the distributed matching algorithm requires no global coordination and achieves polylogarithmic performance ratio in both online and offline settings. Simulation experiments corroborate the theoretical results on solution quality and further evaluate the communication costs of our scheme in practice.

关键词： distributed Matching Resource Management Sensor Networks

来源：评论

学校读者我要写书评

暂无评论

Sorting N items using a p-sorter in optimal time

Sorting N items using a p-sorter in optimal time

引用

International symposium on parallel and distributed processing (IPDPS)

作者： S. Olarin S.Q. Zheng Dept. of Comput. Sci. Old Dominion Univ. Norfolk VA USA Department of Computer Science Louisiana State University Baton Rouge LA USA

A sorting device capable of sorting p items in constant time is called a p-sorter. It is known that the task of sorting N items using a p-sorter requires at least /spl Omega/ (N log N/p log p) applications of the p-sorter. this bound is tight: there exist algorithms that use O (N log N/p log p) calls to the p-sorter to sort N items. However, there is no known implementable algorithm that can sort N items in O(N log N/p log p) time using a p-sorter. the main contribution of this paper is to propose a simple VLSI architecture and to show that in our architecture N items can be sorted in O(N log N/p log p) calls to the p-sorter, while enforcing conflict-free memory accesses. An important feature of our design is that the total additional VLSI area for hardware, other than the memory for data and the p-sorter, is kept to a minimum.

关键词： Sorting Very large scale integration Computer architecture Computer science Semiconductor device measurement Application software Hardware parallel algorithms parallel processing parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Cost/performance of a parallel computer simulator 94

Cost/performance of a parallel computer simulator

引用

Proceedings of the 8th Workshop on parallel and distributed Simulation

作者： Falsafi, Babak Wood, David A. Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton Street Madison WI

ISBN: (纸本)9781565550278

this paper examines the cost/performance of simulating a hypothetical target parallel computer using a commercial host parallel computer. We address the question of whether parallel simulation is simply faster than sequential simulation, or if it is also more cost-effective. To answer this, we develop a performance model of the Wisconsin Wind Tunnel (WWT), a system that simulates cache-coherent shared-memory machines on a message-passing thinking Machines CM-5. the performance model uses Kruskal and Weiss's fork-join model to account for the effect of event processing time variability on WWT's conservative fixed-window simulation algorithm. A generalization of thiebaut and Stone's footprint model accurately predicts the effect of cache interference on the CM-5. the model is calibrated using parameters extracted from a fully-parallel simulation (p=N), and validated by measuring the speedup as the number of processors (p) ranges from one to the number of target nodes (N. Together with simple cost models, the performance model indicates that for target system sizes of 32 nodes and larger, parallel simulation is more cost-effective than sequential simulation. the key intuition behind this result is that large simulations require large memories, which dominate the cost of a uniprocessor; parallel computers allow multiple processors to simultaneously access this large memory.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient scheduling algorithm for sporadic real-time tasks in multiprocessor systems

An energy-efficient scheduling algorithm for sporadic real-t...

引用

13th ieee International Workshop on FTDCS 2011, the 8th International Conference on ATC 2011, the 8th International Conference on UIC 2011 and the 13th ieee International Conference on HPCC 2011

作者： Zhang, Dong-Song Chen, Fang-Yuan Li, Hong-Hua Jin, Shi-Yao Guo, De-Ke National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China School of Computing Science Simon Fraser University 8888 University Drive Burnaby BC V5A 1S6 Canada National Laboratory for Information System Engineering School of Information Systems and Management National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769545387

As the energy consumption of embedded multiprocessor systems becomes increasingly prominent, the real-time energy-efficient scheduling in multiprocessor systems becomes an urgent problem to reduce the system energy consumption while meeting real-time constraints. For a multiprocessor with independent DVFS and DPM at each processor, this paper proposes an energy-efficient real-time scheduling algorithm named LRE-DVFS-EACH, based on LRE-TL which is an optimal real-time scheduling algorithm for sporadic tasks. LRE-DVFS-EACH utilizes the concept of TL plane and the idea of fluid scheduling to dynamically scale the voltage and frequency of processors at the initial time of each TL plane as well as the release time of a sporadic task in each TL plane. Consequently, LRE-DVFS-EACH can obtain a reasonable tradeoff between the real-time constraints and the energy saving. LRE-DVFS-EACH is also adaptive to the change of workload caused by the dynamic release of sporadic tasks, which can obtain more energy savings. the experimental results show that compared with existing algorithms, LRE-DVFS-EACH can not only guarantee the optimal feasibility of sporadic tasks, but also achieve more energy savings in all cases, especially in the case of high workloads. © 2011 ieee.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Towards network-aware divisible load theory for optical grids

Towards network-aware divisible load theory for optical grid...

引用

13th ieee International Workshop on FTDCS 2011, the 8th International Conference on ATC 2011, the 8th International Conference on UIC 2011 and the 13th ieee International Conference on HPCC 2011

作者： Abouelela, Mohamed El-Darieby, Mohamed Software Systems Engineering Department University of Regina Regina SK Canada

ISBN: (纸本)9780769545387

Most grid applications require the processing of large amounts of data stored at different locations across the network which makes optical grid infrastructures optimal for such applications. the increase in intensity of data- and communications of these applications calls for new mechanisms and theories on how to optimally allocate optical grid resources. Typical Divisible Load theory (DLT) makes optimal allocation of computational resources. In this paper, we introduce Network Aware Divisible Load Algorithm (NADLA) that extends DLT to optimally allocate both the computational and networking resources of an optical grid. We assume a data- and communications-intensive application where data is stored at different sites across the optical grid and can be divided into independent subsets to be processed in parallel at different sites. the algorithm defines an optimal data transfer schedule that defines when to transfer what data subsets to which sites across the optical grid in order to minimize the overall application completion time. It consists of two phases. In the first phase, NADLA provide load distribution that minimizes application completion time taking into account network connectivity and computational and networking resources availability. Site connectivity is estimated by considering the bandwidth and the expected free time of all the links connecting this site to other sites. In the second phase, a simple greedy algorithm is used to allocate computational and networking resources. Extensive Simulations are conducted to examine the performance of the proposed algorithm for different application types and sizes, and different optical grid topologies. Simulation results show the advantages of the proposed algorithm over the traditional DLT approach for the category of applications considered. © 2011 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共84页 << < 64 65 66 67 68 69 70 71 72 73 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：