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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,437 篇 会议
109 篇 期刊文献
3 册 图书

馆藏范围

3,549 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,426 篇 工学
- 2,336 篇 计算机科学与技术...
- 1,551 篇 软件工程
- 465 篇 信息与通信工程
- 336 篇 电气工程
- 252 篇 控制科学与工程
- 185 篇 网络空间安全
- 179 篇 电子科学与技术（可...
- 41 篇 生物医学工程（可授...
- 34 篇 动力工程及工程热...
- 29 篇 机械工程
- 29 篇 建筑学
- 29 篇 生物工程
- 28 篇 安全科学与工程
- 25 篇 土木工程
- 23 篇 光学工程
- 22 篇 力学（可授工学、理...
- 20 篇 化学工程与技术
- 20 篇 交通运输工程
- 17 篇 环境科学与工程（可...
1,069 篇 理学
- 949 篇 数学
- 131 篇 统计学（可授理学、...
- 80 篇 系统科学
- 77 篇 物理学
- 37 篇 生物学
- 26 篇 化学
462 篇 管理学
- 363 篇 管理科学与工程(可...
- 231 篇 工商管理
- 123 篇 图书情报与档案管...
43 篇 经济学
- 43 篇 应用经济学
21 篇 法学
- 21 篇 社会学
15 篇 农学
14 篇 医学
11 篇 教育学
3 篇 文学
1 篇 军事学

主题

490 篇 parallel process...
381 篇 parallel process...
313 篇 concurrent compu...
294 篇 computer science
276 篇 distributed comp...
266 篇 distributed comp...
217 篇 parallel algorit...
163 篇 computer archite...
162 篇 application soft...
132 篇 computational mo...
130 篇 parallel program...
121 篇 costs
118 篇 hardware
110 篇 algorithm design...
110 篇 computer network...
108 篇 delay
107 篇 processor schedu...
88 篇 distributed proc...
84 篇 parallel archite...
78 篇 hypercubes

机构

13 篇 pacific northwes...
11 篇 ieee
9 篇 syracuse univ sy...
9 篇 georgia inst of ...
9 篇 department of co...
8 篇 new jersey inst ...
7 篇 ibm thomas j. wa...
7 篇 school of comput...
7 篇 purdue univ west...
7 篇 irisa rennes
6 篇 texas a&m univ c...
6 篇 univ of californ...
6 篇 michigan state u...
6 篇 univ of maryland...
6 篇 institute of com...
6 篇 ohio state univ ...
6 篇 carnegie mellon ...
5 篇 department of co...
5 篇 department of co...
5 篇 university of lu...

作者

14 篇 bader david a.
10 篇 li keqin
9 篇 zomaya albert y.
9 篇 prasanna viktor ...
9 篇 das sajal k.
8 篇 prasad sushil k.
8 篇 maciejewski anth...
8 篇 sussman alan
8 篇 sun xian-he
7 篇 ibarra oscar h.
7 篇 boukerche azzedi...
7 篇 casanova henri
7 篇 talbi el-ghazali
7 篇 panda dhabaleswa...
7 篇 olariu s.
7 篇 cai wentong
7 篇 ahmad ishfaq
7 篇 aluru srinivas
6 篇 pan yi
6 篇 dongarra jack

语言

3,503 篇 英文
45 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing"

共 3549 条记录，以下是1331-1340 订阅

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

详细简洁

排序：

Energy efficient multi-hop polling in clusters of two-layered heterogeneous sensor networks

Energy efficient multi-hop polling in clusters of two-layere...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Zhang, Zhenghao Ma, Ming Yang, Yuanyuan Department of Electrical and Computer Engineering State University of New York Stony Brook NY 11794 United States

ISBN: (纸本)0769523129

In this paper we study two-layered heterogeneous sensor networks where two types of nodes are deployed in the network: basic sensor nodes and cluster head nodes. Basic sensor nodes are simple and inexpensive, while cluster head nodes are much powerful and much richer in energy. A cluster head node organizes the basic sensor nodes around it into a cluster. A basic sensor node does data collections and sends the data packets when polled by the cluster head. By introducing hierarchy, such a two-layered heterogeneous sensor network has better scalability than homogeneous sensor networks. It also has a smaller overall cost since networking functionalities are shifted from sensors to the cluster head. It also has a longer life time, as sensors send packets only when polled by the cluster head and less energy is consumed in collisions and idle listening. This type of network will be ideally suited for applications such as environmental monitoring. In this paper, we focus on finding energy efficient and collision-free polling schedules in the multi-hop cluster. To reduce energy consumption in idle listening, a schedule is optimal if it uses minimum time. We show that the problem of finding an optimal schedule is NP-hard, and then give a fast on-line algorithm. We also consider dividing a cluster into sectors to further reduce the idle listening time of sensors. We conducted simulations on the NS-2 simulator, and the results show that our polling scheme can reduce the active time of sensors by a significant amount while sustaining 100% throughput.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Reducing power with performance constraints for parallel sparse applications

Reducing power with performance constraints for parallel spa...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Chen, G. Malkowski, K. Kandemir, M. Raghavan, P. Department of Computer Science and Engineering Pennsylvania State University University Park PA 16802 United States

ISBN: (纸本)0769523129

Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational workload in such computations across parallel processors, achieving sustained near machine-peak performance with close-to-ideal load balanced computation-to-processor mapping is inherently difficult. As a result, most of the time, the loads assigned to parallel processors can exhibit significant variations. While there have been numerous past efforts that study this imbalance from the performance viewpoint, to our knowledge, no prior study has considered exploiting the imbalance for reducing power consumption during execution. Power consumption in large-scale clusters of workstations is becoming a critical issue as noted by several recent research papers from both industry and academia. Focusing on sparse matrix computations in which underlying parallel computations and data dependencies can be represented by trees, this paper proposes schemes that save power through voltage/frequency scaling. Our goal is to reduce overall energy consumption by scaling the voltages/frequencies of those processors that are not in the critical path;i.e., our approach is oriented towards saving power without incurring performance penalties.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

The effect of different failure recovery procedures on the distribution of task completion times

The effect of different failure recovery procedures on the d...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Sheahan, Robert Lipsky, Lester Fiorini, Pierre Department of Computer Science and Engineering University of Connecticut Storrs CT 06269-2155 Department of Computer Science University of Southern Maine Portland ME

ISBN: (纸本)0769523129

For a system to be reliable, it must have one or more methods of dealing with failures. distributed systems face both node failure and communication channel failure. Communication channels, in particular, may suffer failures at a very high rate. Different systems respond to task failure in different ways. The system may resume a failed task from the failure point (or a saved checkpoint shortly before the failure point), it may restart the task, or it may give up on the task and select a replacement task from the ready queue. These three responses to failure all change the distribution of task completion times. The distribution of completion times is important because it governs mean service time and queue length, and therefore quality of service and buffer size necessary to manage the risk of overflow. The changes to the distribution introduced by the failure response can even turn well behaved exponentially distributed times into powertail distributed times with infinite mean and variance. In this paper we examine the characteristics of distributions that result from restarting after each interrupt, with some discussion of Resume and Replace, for comparison. We provide analytic and simulation solutions.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Using message-driven objects to mask latency in grid computing applications

Using message-driven objects to mask latency in grid computi...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Koenig, Gregory A. Kale, Laxmikant V. Department of Computer Science University of Illinois Urbana-Champaign

ISBN: (纸本)0769523129

One of the attractive features of Grid computing is that resources in geographically distant places can be mobilized to meet computational needs as they arise. A particularly challenging issue is that of executing a single application across multiple machines that are separated by large distances. While certain classes of applications such as pipeline style or master-slave style applications may run well in Grid computing environments with little or no modification, tightly-coupled applications require significant work to achieve good performance. In this paper, we demonstrate that message-driven objects, implemented in the Charm++ and Adaptive MPI systems, can be used to mask the effects of latency in Grid computing environments without requiring modification of application software. We examine a simple five-point stencil decomposition application as well as a more complex molecular dynamics application running in an environment in which arbitrary artificial latencies can be induced between pairs of nodes. Performance of the applications running under artificial latencies are compared to the performance of the applications running across TeraGrid nodes located at the National Center for Supercomputing Applications andArgonne National Laboratory. © 2005 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

High performance computing environments without the fuss: The bootable cluster CD

High performance computing environments without the fuss: Th...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Diesburg, Sarah M. Gray, Paul A. Joiner, David Department of Computer Science University of Northern Iowa Cedar Falls IA 50614 Department of Science and Technology Education Kean University Union NJ 07083

ISBN: (纸本)0769523129

This paper confronts the issue of bringing high performance computing (HPC) education to those who do not have access to a dedicated clustering environments in an easy, fully-functional, inexpensive manner through the use of the "Bootable Cluster CD" (BCCD). As an example, many primarily undergraduate institutions (PUI's) do not have the facilities, time, or money to purchase hardware, maintain user accounts, configure software components, and keep ahead of the latest security advisories for a dedicated clustering environment. The BCCD project's primary goal is to support an instantaneous, drop-in distributed computing environment. A consequence of providing such an environment is the ability to promote the education of high performance computing issues at the undergraduate level through the ability to turn an ordinary lab of networked workstations temporarily into a non-invasive, fully-functional clustering classroom. The BCCD itself is a self-contained clustering environment in a bootable CD format. Using the BCCD, students, educators and researchers are able to gain insight into configuration, utilization, troubleshooting, debugging, and administration issues uniquely associated with parallel computing in a live, easy to use "drop-in" clustering environment. As the name implies, the BCCD provides a full, cohesive clustering environment running GNU/Linux when booted from the CDROM drives of networked workstations.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

REPLICA: A bitstream manipulation filter for module relocation in partial reconfigurable systems

REPLICA: A bitstream manipulation filter for module relocati...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Kalte, H. Lee, G. Porrmann, M. Rückert, U. University of Western Australia School of Computer Science and Software Engineering 35 Stirling Highway Crawley WA 6009 Heinz Nixdorf Institute System and Circuit Technology University of Paderborn 33102 Paderborn Germany

ISBN: (纸本)0769523129

The feature of partial reconfiguration provided by currently available Field Programmable Gate Arrays (FPGAs) makes it possible to change hardware modules while others keep working. The combination of this feature and the high gate capacity enables the integration of dynamic systems that can be adapted to changing demands during runtime. Placing the dynamically changing modules along a horizontal communication infrastructure does not only provide communication facilities it also enables the relocation of pre-synthesized modules by bitstream manipulations. The exact placement of an incoming module is determined according to the current resource allocation, which results in an online placement problem. In order to prevent any extra configuration overhead for the relocation process, we developed the REPLICA (Relocation per online Configuration Alteration) filter, which is capable of performing the necessary bitstream manipulations during the regular download process. The filter architecture, a Configuration Manager and an evaluation example are presented in this paper.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

An experimental study of parallel biconnected components algorithms on symmetric multiprocessors (SMPs)

An experimental study of parallel biconnected components alg...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Cong, Guojing Bader, David A. IBM T.J. Watson Research Center Yorktown Heights NY 10598 United States Department of Electrical and Computer Engineering University of New Mexico Albuquerque NM 87131 United States

ISBN: (纸本)0769523129

We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connectivity, spanning tree, and tree computations. Previous experimental studies of these primitives demonstrate reasonable parallel speedups. However, when these algorithms are used as subroutines to solve higher-level problems, there are two factors that hinder fast parallel implementations. One is parallel overhead, i.e., the large constant factors hidden in the asymptotic bounds;the other is the discrepancy among the data structures used in the primitives that brings non-negligible conversion cost. We present various optimization techniques and a new parallel algorithm that significantly improve the performance of finding biconnected components of a graph on symmetric multiprocessors (SMPs). Finding biconnected components has application in fault-tolerant network design, and is also used in graph planarity testing. Our parallel implementation achieves speedups up to 4 using 12 processors on a Sun E4500 for large, sparse graphs, and the source code is freely-available at our web site http://***/~dbader.

关键词： Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

Supporting load balancing and efficient reorganization during system scaling

Supporting load balancing and efficient reorganization durin...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Zhu, Feng Sun, Xiaowei Salzberg, Betty Hvasshovd, Svein-Olaf College of Computer and Information Science Northeastern University Boston MA 02115 Norwegian Institute of Science and Technology Trondheim Norway

ISBN: (纸本)0769523129

Reorganization becomes constantly necessary for maintaining load balancing as distributed storage systems scale up and down. To support load balancing and efficient reorganization during system scaling, we propose a new hashing method called Prime Based Hashing (PBH) that can be used for data allocation in large distributed systems. PBH distributes objects among storage units based on residues (congruence) of hash-transformed key values modulo prime numbers. PBH provides nearly perfect load balancing, distributes objects evenly and rebalances to preserve the even distribution as system scales. At the same time it facilitates cost-effective reorganization by minimizing data migration during system scaling. Locating an object in PBH is fast through low complexity computations, requiring only the knowledge of the total number of storage units. We also propose a local data clustering method to couple with PBH to make reorganization more efficient. Objects are clustered according to the order of migration so that only the part of the data that needs to be migrated is scanned. In addition, we show that by storing a small amount of pre-computed information, ordering of objects for clustering can be very efficient. We demonstrate through analysis and experiments the effectiveness of our algorithms.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

An efficient distributed algorithm for constructing delay- and degree-bounded application-level multicast tree

An efficient distributed algorithm for constructing delay- a...

引用

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

作者： Feng, Liu Jingshu, Huang Xicheng, Lu Yuxing, Peng National Laboratory for Parallel and Distributed Processing Changsha 410073 China School of Electrical and Computer Engineering Purdue University West Lafayette IN 47907-2035 United States

ISBN: (纸本)0769525091

In this paper we investigate the problem of finding a delay- and degree-bounded maximum sum of nodes application level multicast tree. We then proved the problem is NP-hard, and its relationship with the well-studied degree-bounded minimum maximum-delay multicast tree problem. We propose a distributed algorithm - OverStream, which adopts PPAF heuristic for father node to choose optimal child nodes based on multiple network parameters. Simulation results show that our algorithm is better than OMNI, SpreadIt, HMTP, and Zigzag in general. © 2005 ieee.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

Using manufacturing process flow for time synchronization in HLA-based simulation

Using manufacturing process flow for time synchronization in...

引用

9th ieee International symposium on distributed Simulation and Real-Time Applications

作者： Gan, Boon Ping Low, Malcolm Yoke Hean Wang, Xiaoguang Turner, Stephen John D-SIMLAB Programme Singapore Institute of Manufacturing Technology 71 Nanyang Drive Singapore 638075 Singapore Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University Nanyang Avenue Singapore 639798 Singapore

Time synchronization has always been a critical deciding factor of whether interoperating simulation models using the High Level Architecture (HLA) is achievable efficiently. In this paper, we propose a conservative time synchronization algorithm that makes use of the manufacturing process flow information (a sequence of steps production lots flow through) in the computation of the request time. This time is used by the simulation federate to issue requests to advance time to the HLA Runtime Infrastructure (RTI). The proposed algorithm monitors the simulation events that potentially trigger external times tamp messages at the exit step and j processing steps before this exit step as well as simulation events that extend the timestamp of external messages. We evaluated the performance of this algorithm using a Borderless Fab simulation model on the AutoSched AP. The experimental results show that the algorithm performs much better than a straightforward use of the RTI's time synchronization, and the further back we went in looking at the processing steps, the better the execution time that was achieved. © 2005 ieee.

关键词： Computer architecture

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共355页 << < 130 131 132 133 134 135 136 137 138 139 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：