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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

768 篇 会议
27 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

384 篇 工学
- 362 篇 计算机科学与技术...
- 194 篇 软件工程
- 58 篇 信息与通信工程
- 51 篇 电气工程
- 27 篇 电子科学与技术（可...
- 18 篇 控制科学与工程
- 13 篇 材料科学与工程（可...
- 7 篇 安全科学与工程
- 7 篇 网络空间安全
- 4 篇 生物医学工程（可授...
- 3 篇 光学工程
- 3 篇 动力工程及工程热...
- 3 篇 生物工程
- 2 篇 力学（可授工学、理...
- 2 篇 机械工程
- 2 篇 冶金工程
- 2 篇 土木工程
- 2 篇 交通运输工程
101 篇 理学
- 95 篇 数学
- 18 篇 统计学（可授理学、...
- 8 篇 系统科学
- 5 篇 物理学
- 4 篇 生物学
72 篇 管理学
- 51 篇 管理科学与工程(可...
- 38 篇 工商管理
- 24 篇 图书情报与档案管...
8 篇 经济学
- 8 篇 应用经济学
7 篇 医学
- 7 篇 临床医学
- 2 篇 基础医学(可授医学...
3 篇 法学
- 3 篇 社会学
1 篇 教育学
1 篇 文学
1 篇 农学
1 篇 军事学

主题

121 篇 computer science
94 篇 concurrent compu...
94 篇 distributed comp...
83 篇 distributed data...
79 篇 parallel process...
78 篇 application soft...
76 篇 databases
74 篇 database systems
73 篇 parallel process...
55 篇 delay
53 篇 distributed comp...
52 篇 processor schedu...
45 篇 computer archite...
43 篇 transaction data...
41 篇 algorithm design...
40 篇 costs
39 篇 relational datab...
35 篇 protocols
34 篇 computational mo...
33 篇 hardware

机构

6 篇 ibm thomas j. wa...
5 篇 ieee
4 篇 school of comput...
4 篇 department of co...
4 篇 department of co...
3 篇 center for paral...
3 篇 department of co...
3 篇 lip ens-lyon lyo...
3 篇 department of co...
2 篇 department of co...
2 篇 institute of inf...
2 篇 department of co...
2 篇 institute of inf...
2 篇 computer systems...
2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
2 篇 department of el...
2 篇 department of co...
2 篇 school of comput...

作者

7 篇 a. choudhary
6 篇 a. boukerche
5 篇 j. saltz
4 篇 s.k. das
4 篇 t. kurc
4 篇 a. el abbadi
3 篇 a. rau-chaplin
3 篇 o. wolfson
3 篇 f. dehne
3 篇 p.s. yu
3 篇 a. singh
3 篇 casanova henri
3 篇 c. liu
3 篇 a. bar-noy
3 篇 s. kipnis
3 篇 g. gupta
3 篇 d. agrawal
3 篇 x. shen
2 篇 grove matthew
2 篇 a. burger

语言

792 篇 英文
4 篇 其他

检索条件"任意字段=Proceedings of the first international symposium on Databases in parallel and distributed systems"

共 796 条记录，以下是261-270 订阅

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

详细简洁

排序：

Dynamic key messaging for cluster computing

Dynamic key messaging for cluster computing

引用

3rd IEEE international symposium on Network Computing and Applications

作者： Zhu, M Wang, Y Ding, M Katsinis, C Drexel Univ Dept Elect & Comp Engn Philadelphia PA 19104 USA

ISBN: (纸本)0769522424

Over the past decades, distributed computing has been gaining popularity. It provides more computing power and memory space for parallel applications. On the other hand, such applications fight back and challenge the architectures of the distributed systems for more efficiency. To face the challenge, a Key Messaging (KM) scheme was proposed to realize the optimization of communication at a system architecture level in our previous papers. The contribution of KM is that it performs the optimization in both the underlying communication system and high level application model. The performance of an application is always determined by its critical path. Currently, messages along the critical path can be easily blocked by non-critical path messages, which degrades the performance. To solve this problem, KM provides an algorithm to identify the critical-path messages and optimizes them by introducing a prioritized protocol layer Thus, these messages will be served first before any low priority messages. Shorter processing time for the messages results in faster completion time of the critical path.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Discouraging free riding in a peer-to-peer CPU-sharing grid

Discouraging free riding in a peer-to-peer CPU-sharing grid

引用

13th IEEE international symposium on High Performance distributed Computing (HPDC-13)

作者： Andrade, N Brasileiro, F Cirne, W Mowbray, M Univ Fed Campina Grande Dept Sistemas & Comp Campina Grande Brazil

ISBN: (纸本)0780321754

Grid computing has excited many with the promise of access to huge amounts of resources distributed across the globe. However there are no largely, adopted solutions for automatically assembling grids, and this limits the scale of today's grids. Some argue that this is due to the overwhelming coinplexity of the proposed economy-based solutions. Peer-to-peer grids have emerged as a less complex alternative. We are currently deploying OurGrid, one such peer-to-peer grid. OurGrid is a CPU-sharing grid that targets Bag-of-Tasks applications (i.e. parallel applications whose tasks are independent). In order to ease system deployment, OurGrid is based on a very lightweight autonomous reputation scheme. Free riding is an iniportant issue for any peer-to-peer system. The aim of this paper is to show that OurGrid's reputation system successfully discourages free riding, making it in each peer's own interest to collaborate with the peer-to-peer community We show this in two steps. first, we analyze the conditions under which a reputation scheme can discourage free riding in a CPU-sharing grid. Second, we show that OurGrid's reputation scheme satisfies these conditions, even in the presence of malicious peers. Unlike other distributed mechanisms for discouraging free riding, OurGrid's reputation scheme achieves this without requiring a shared cryptographic infrastructure or specialized storage..

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Time-sensitive computation of aggregate functions over distributed imprecise data

Time-sensitive computation of aggregate functions over distr...

引用

proceedings - 18th international parallel and distributed Processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Han, Qi Nguyen, Matthew Ba Irani, Sandy Venkatasubramanian, Nalini Sch. of Info. and Computer Science University of California Irvine CA 92697-3425

ISBN: (纸本)0769521320

Many distributed applications in the real world now require real time services in which aggregate queries need to be computed over a set of values. These applications can often tolerate varying degrees of inaccuracy in the results. System designers, on the other hand, would like to provide services with low inaccuracy and minimal management overhead. In this paper, we focus on addressing the tradeoffs between timeliness, accuracy and cost for data aggregation in distributed environments. Specifically, we address the problem of time-sensitive computation of aggregate queries(count, sum and min) over a set of values represented by intervals with lower and upper bounds. These intervals are approximations based on most recent values about distributed sources. In order to meet the precision constraints from users, a subset of sources needs to be probed for exact values. We first propose algorithms for batch selection of the probing set, where selection is done before probing without the knowledge of the actual values. In addition, we propose an iterative selection approach where the selection of the next probing source depends on the previous returned value.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Utilizing home node prediction to improve the performance of software distributed shared memory

Utilizing home node prediction to improve the performance of...

引用

proceedings - 18th international parallel and distributed Processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Peng, Song Speight, Evan Computer Systems Laboratory Cornell University Ithaca NY 14853 Future Systems Group IBM Research Austin TX 78758

ISBN: (纸本)0769521320

Many researchers use a home-based lazy release consistent protocol (HLRC) to provide a simple, effective, and scalable way to build software distributed shared memory (DSM) systems. However, the performance of HLRC is notoriously sensitive to the initial page distribution among home nodes. This paper proposes an adaptive HLRC protocol in which the home page designation is able to change according to the observed application sharing pattern. Our system differs from HLRC and other adaptive derivatives in the following respects. first, the number of home nodes for each shared page can be varied, as opposed to having only a single home node. Second, we use prediction in a novel way to dynamically change the the location of home nodes according to different memory access patterns. The home node of each shared page is able to propagate, perish, and migrate. An online home predictor determine whether or not the current node should remain a home node or drop from the current set of home nodes for a given page. Finally, all decisions concerning home node group membership are made locally, eliminating the costly global decision-making communication present in many other systems. Performance evaluations using six well-known DSM benchmarks show that our adaptive protocol outperforms conventional HLRC by up to 60%.

关键词： Storage allocation (computer)

来源：评论

学校读者我要写书评

暂无评论

A new algorithm for computing the Smith normal form and its implementation on parallel machines

A new algorithm for computing the Smith normal form and its ...

引用

proceedings - 18th international parallel and distributed Processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Jäger, Gerold Mathematisches Seminar Chrstn.-Albrechts-Univ. zu Kiel Christian-Albrechts-Platz 4 24118 Kiel Germany

ISBN: (纸本)0769521320

Smith normal form computation is important in many topics, e.g. group theory and number theory. For matrices over the rings and double-struck F2[x], we introduce a new Smith normal form algorithm, called Triangular Band Matrix Algorithm, which first computes the Hermite Normalform and then step by step the diagonal form and the Smith normal form. In comparison to the Kannan Bachem Algorithm, which computes the Smith normal form by alternately computing the Hermite normal form and the left Hermite normal form, the theoretical advantage is, that we only once apply the expensive Hermite normal form step. We parallelize the Triangular Band Matrix Algorithm and get a better complexity analysis than for previous parallel algorithms, like the Kannan Bachem Algorithm and the Hartley Hawkes Algorithm. In the part, which is different to the Kannan Bachem Algorithm, the Triangular Band Matrix Algorithm leads to a better efficiency and smaller execution times, even for large example matrices.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Load balancing: Dimension exchange on product graphs

Load balancing: Dimension exchange on product graphs

引用

proceedings - 18th international parallel and distributed Processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Arndt, Holger University of Wuppertal Fac. of Math. and Natural Sciences Gaußstraße 20 D-42119 Wuppertal Germany

ISBN: (纸本)0769521320

Load balancing on parallel computers aims at equilibrating some initial load which is initially different from one processor to another. Nearest neighbour load balancing algorithms can be divided basically into two classes: diffusion and dimension exchange. Whereas the first is appropriate for the so-called all-port-model where a processor can send tokens to all its neighbours at a time, the latter relies on the one-port-model. In the last few years finite diffusion algorithms for general graphs as well as for product graphs like grids and tori have been developed. Recently finite dimension exchange algorithms have been proposed by the author. In the present paper we will introduce one new diffusion and two new dimension-exchange schemes for product graphs. We will show that the latter two can achieve nearly minimal communication operations and therefore short run-times. Additionally some modifications of the algorithms will be presented that reduce the flows so that only very few load items are moved via longer paths than necessary.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

UT Grid: A comprehensive campus cyberinfrastructure

UT Grid: A comprehensive campus cyberinfrastructure

引用

proceedings - 13th IEEE international symposium on High Performance distributed Computing

作者： Boisseau, John R. Texas Advanced Computing Center University of Texas Austin

UT Grid is a comprehensive campus cyberinfrastructure project to integrate the numerous and diverse computational, visualization, storage, data and information, and instrument/device resources of The University of Texas at Austin (UT). This joint project between UT Austin and IBM has a focus and approach with important fundamental differences from multi-institution grids and discipline-specific grids. These distinctions, coupled with new locally -developed software for providing both portal and shell-based user interfaces to numerous grid software technologies, will facilitate rapid deployment, adoption, and evolution of UT Grid, while enabling it to serve as a platform for both production computing (for research and education) and grid computing research. The first stages of UT grid are well under way after only two months: the construction of grid user portals and grid user nodes as interfaces, and the integration of serial and parallel computing resources for high-throughput computing.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A fast, parallel spanning tree algorithm for symmetric multiprocessors SMPs

A fast, parallel spanning tree algorithm for symmetric multi...

引用

proceedings - 18th international parallel and distributed Processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Bader, David A. Cong, Guojing Electrical Engineering Department University of New Mexico Albuquerque NM 87131

ISBN: (纸本)0769521320

Our study in this paper focuses on implementing parallel spanning tree algorithms on SMPs. Spanning tree is an important problem in the sense that it is the building block for many other parallel graph algorithms and also because it is representative of a large class of irregular combinatorial problems that have simple and efficient sequential implementations and fast PRAM algorithms, but often have no known efficient parallel implementations. In this paper we present a new randomized algorithm and implementation with superior performance that for the first-time achieves parallel speedup on arbitrary graphs (both regular and irregular topologies) when compared with the best sequential implementation for finding a spanning tree. This new algorithm uses several techniques to give an expected running time that scales linearly with the number p of processors for suitably large inputs (n > p2). As the spanning tree problem is notoriously hard for any parallel implementation to achieve reasonable speedup, our study may shed new light on implementing PRAM algorithms for shared-memory parallel computers. The main results of this paper are 1. A new and practical spanning tree algorithm for symmetric multiprocessors that exhibits parallel speedups on graphs with regular and irregular topologies;and 2. An experimental study of parallel spanning tree algorithms that reveals the superior performance of our new approach compared with the previous algorithms. The source code for these algorithms is freely-available from our web site ***.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

An execution-time estimation model for heterogeneous clusters

An execution-time estimation model for heterogeneous cluster...

引用

proceedings - 18th international parallel and distributed Processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Kishimoto, Yoshinori Ichikawa, Shuichi Dept. of Knowledge-based Info. Eng. Toyohashi University of Technology 1-1 Hibarigaoka Tempaku Toyohashi 441-8580 Japan

ISBN: (纸本)0769521320

Heterogeneous clusters are flexible and cost-effective, but entail intrinsic difficulties in optimization. Although it is simple to invoke multiple processes on fast processing elements (PEs) to alleviate load imbalance, the optimum process allocation is not so obvious. Communication time is another problem. It is sometimes better to exclude slow PEs to avoid performance degradation, but it is generally difficult to find the optimal PE configuration. In this study, the execution time is first modeled from the measurement results of various configurations. Then, the derived model is used to estimate the optimal PE configuration and process allocation. We implemented the models from HPL (High Performance Linpack benchmark) of N = 400-6400, and estimated the optimal configuration for N = 3200-9600. The execution time of the estimated optimal configuration was 0%-3.6% longer than the actual optimal configuration. The models derived from N = 1600-6400 were also constructed, and their errors were 0%-4.3% for N = 1600-9600.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

An algorithm for geometric load balancing with two constraints

An algorithm for geometric load balancing with two constrain...

引用

proceedings - 18th international parallel and distributed Processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Kim, Jiyoun Papaefthymiou, Marios Tayyab, Athar Adv. Comp. Architecture Laboratory EECS Department University of Michigan Ann Arbor MI 48109 IBM Microelectronics Austin TX 78758

ISBN: (纸本)0769521320

This paper describes an algorithm for partitioning 2-weighted geometric graphs, so that each of the two weights is evenly distributed among all partitions and cutsize is minimal. This algorithm is applicable to load balancing problems in parallel computing, including scientific computation or circuit optimization, in which computational load depends on multiple factors, and geometric proximity needs to be preserved. We first show that for two continuous weight distributions, there always exists an L-shape separator that divides the two weights exactly. Based on this fact, we then give a practical and efficient heuristic for 2p-way partitioning. Our heuristic relies on recursive bipartitioning and runs in O(nlgn + m2p) time, where n is the number of vertices and m is the number of rows in the graph. In experiments with geometric graphs obtained from placed benchmark VLSI circuits, our heuristic generates balanced partitions with imbalance no greater than 2%, very short runtimes, and good cutsizes. For example, given a geometric graph with n > 100,000, our heuristic computes a 32-way partitioning with 0.46% maximum imbalance within 0.5 second.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共80页 << < 23 24 25 26 27 28 29 30 31 32 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：