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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

291 篇 会议
9 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

224 篇 工学
- 216 篇 计算机科学与技术...
- 149 篇 软件工程
- 58 篇 信息与通信工程
- 12 篇 电气工程
- 6 篇 生物工程
- 4 篇 机械工程
- 3 篇 化学工程与技术
- 3 篇 生物医学工程（可授...
- 2 篇 电子科学与技术（可...
- 1 篇 仪器科学与技术
- 1 篇 控制科学与工程
- 1 篇 安全科学与工程
27 篇 理学
- 18 篇 数学
- 8 篇 生物学
- 3 篇 化学
- 3 篇 统计学（可授理学、...
- 2 篇 物理学
- 1 篇 系统科学
15 篇 管理学
- 13 篇 管理科学与工程(可...
- 5 篇 工商管理
- 3 篇 图书情报与档案管...
2 篇 法学
- 2 篇 社会学

主题

33 篇 cloud computing
16 篇 parallel computi...
11 篇 parallel process...
11 篇 distributed comp...
11 篇 distributed comp...
9 篇 computer archite...
9 篇 computational mo...
8 篇 parallel program...
8 篇 resource managem...
8 篇 distributed syst...
7 篇 peer to peer com...
7 篇 optimization
7 篇 high performance...
6 篇 fault tolerance
6 篇 educational inst...
6 篇 servers
6 篇 real-time system...
6 篇 protocols
6 篇 performance eval...
6 篇 gpu

机构

3 篇 a*star institute...
3 篇 topic committee ...
2 篇 univ adelaide sc...
2 篇 univ texas dept ...
2 篇 washington univ ...
2 篇 school of comput...
2 篇 laria laboratoir...
2 篇 guizhou universi...
2 篇 guizhou universi...
2 篇 beihang univ sta...
2 篇 graduate school ...
2 篇 los alamos natl ...
2 篇 tsinghua univers...
2 篇 univ calif san d...
2 篇 department of co...
2 篇 scripps res inst...
2 篇 kth royal inst t...
2 篇 natl univ def te...
2 篇 college of compu...
2 篇 kent state univ ...

作者

5 篇 li xiaorong
3 篇 xiaorong li
2 篇 seme david
2 篇 kanagasabai raja...
2 篇 cong guojing
2 篇 riccardo loti
2 篇 le duy ngan
2 篇 putchong uthayop...
2 篇 dongarra jack
2 篇 motomura shinich...
2 篇 taufer m
2 篇 ta nguyen binh d...
2 篇 kawamura takao
2 篇 vlassov vladimir
2 篇 kerbyson dj
2 篇 bader david a.
2 篇 tziritas nikos
2 篇 wu weigang
2 篇 liu jie
2 篇 coddington pd

语言

303 篇 英文

检索条件"任意字段=18th International Conference on Parallel and Distributed Computing Systems, PDCS 2005"

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

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

详细简洁

排序：

ON REARRANGEABILITY of CASCADED BANYAN-TYPE NETWORKS 18

ON REARRANGEABILITY of CASCADED BANYAN-TYPE NETWORKS

引用

18th international conference on parallel and distributed computing systems, pdcs 2005

作者： Tan, Xuesong Robert Li, Shuo-Yen Department of Information Engineering The Chinese University of Hong Kong Room 735 SHB CUHK Shatin N.T. Hong Kong Hong Kong

ISBN: (纸本)9781604234565

the cascade of two baseline networks in tandem is a rearrangeable network. the cascade of two omega networks through a certain interconnection pattern is also rearrangeable. these belong to the general problem: for what banyan-type network (i.e., bit-permuting unique-routing network) is the tandem cascade a rearrangeable network? We relate the problem to the trace and guide of banyan-type networks. When the trace and guide of a 2n×2n banyan-type network are represented by the permutations τ and γ on integers 1 to n, respectively, rearrangeability of the tandem cascade of the network is solely determined by τγ–1. Such a permutation is said to be tandem rearrangeable when the tandem cascade is indeed rearrangeable. We identify a few tandem rearrangeable permutations, each implying the rearrangeability of the tandem cascade of a wide class of banyan-type networks. © 2005 18th ISCA international conference on parallel and distributed computing systems 2005, pdcs 2005. All rights reserved.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Towards a Simple Service Class for distributed Multimedia Applications in Next Generation IP Networks 18

Towards a Simple Service Class for Distributed Multimedia Ap...

引用

18th international conference on parallel and distributed computing systems, pdcs 2005

作者： Usha, M. Wahida Banu, R.S.D. Salem636 005 India Dept. of Computer Science and Engineering Govt. College of Engineering Anna University Salem636 011 India

ISBN: (纸本)9781604234565

the Internet carries all types of traffic and provides end-to-end Quality of Service. But high-demanding audio and video applications that operate in distributed environments are very sensitive to transmission delay and jitter. the best-effort unpredictable nature of the Internet is unfriendly to stream traffic generated by voice and video. this paper suggests a ‘Better than Best Effort’ treatment to such flows. An important contribution is that a simple classification at the router identifying these ‘favored’ UDP flows simplifies the entire service model. A simple AQM (Active Queue Management) scheme is proposed. the flows belonging to certain multimedia applications are given preference, yet giving fair chance to other flows. the AQM algorithm is a modified version of the de facto standard RED (random Early Detection). RED favors only TCP and TCP-friendly flows in congestion avoidance. this work aims at providing a service class to these normally victimized non-TCP friendly flows. Simulation results show that fairness can also be maintained with other flows. © 2005 18th ISCA international conference on parallel and distributed computing systems 2005, pdcs 2005. All rights reserved.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Performance Prediction-based versus Load-based Site Selection: Quantifying the Difference 18

Performance Prediction-based versus Load-based Site Selectio...

引用

18th international conference on parallel and distributed computing systems, pdcs 2005

作者： Jang, Seung-Hye Taylor, Valerie Wu, Xingfu Prajugo, Mieke Deelman, Ewa Mehta, Gaurang Vahi, Karan Department of Computer Science Texas A&M University College StationTX77843 United States USC Information Sciences Institute 4676 Admiralty Way Marina Del ReyCA90292 United States

ISBN: (纸本)9781604234565

distributed systems are available and provide vast compute and data resources to users. With the availability of multiple resources, one of the major issues to be addressed is site selection. Users have access to many resource sites from which to select for execution of applications. In this paper, we quantify the advantages of using performance prediction to select sites as compared to using load information, which is a widely used method. the quantification is based upon two case studies. the first case study involves a large-scale scientific application, called GEO LIGO, for which the experimental results indicate an average of 33% performance improvement as compared to a load-based method. the second case study involves a web-based, educational application, called AADMLSS, for which the results indicate an average of 10% performance improvement as compared to a load-based method. © 2005 18th ISCA international conference on parallel and distributed computing systems 2005, pdcs 2005. All rights reserved.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

A Feasible Baseline Architecture for Building and Evaluating distributed systems 18

A Feasible Baseline Architecture for Building and Evaluating...

引用

18th international conference on parallel and distributed computing systems, pdcs 2005

作者： Chen, Kevin F. Liu, Meilin Sha, Edwin H.-M. Department of Computer Science University of Texas at Dallas RichardsonTX75083 United States

ISBN: (纸本)9781604234565

Although distributed networks and systems are widely deployed, an effective overall benchmark architecture is still lacking. Recently we defined and studied the fat-stack network architecture and found that it is both efficient and scalable to distributed systems of various scales. In precedent work, we theoretically proved that the fat-stack is universal by measure of routing efficiency with a low 1.5-powered logarithmic overhead. Universality implies that the fat-stack of a given size is nearly the best routing network of that size. the fat-stack is also the minimal universal network in terms of number of links and nodes used. In this paper, we add more analytical proof and report our simulation results. Simulations show that the fat-stack outperforms a mesh-based distributed network of comparable hardware usage. We show how the fat-stack can be an effective benchmark architecture and how to scale the network from a VLSI graph layout to a large-scale distributed topology. Our work helps explain why some deployed networks function in the way they do in terms of routing. It also provides an exemplary network of proven efficiency and scalability for building new distributed systems. © 2005 18th ISCA international conference on parallel and distributed computing systems 2005, pdcs 2005. All rights reserved.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Performance Sensitivity of Adaptive Space Sharing to parallel Job Structure and I/O Models 18

Performance Sensitivity of Adaptive Space Sharing to Paralle...

引用

18th international conference on parallel and distributed computing systems, pdcs 2005

作者： Wang, Liuhong Dandamudi, Sivarama School of Computer Science Carleton University 1125 Colonel By Drive OttawaONK1S 5B6 Canada

ISBN: (纸本)9781604234565

We study the performance of an adaptive space sharing policy for parallel systems when the application involves I/O operations. We consider four types of I/O models in this paper: NO, NOP, O1 and O2 models. In the NO and NOP models, jobs can either perform an I/O operation or a computation. In the O1 and O2 models, I/O operations overlap with computation. In the O1 model, I/O operations are done at the beginning and end of each task. In contrast, in the O2 model, I/O operations and computation are interleaved. these I/O models are studied in combination with three parallel job structures: Fork-and-Join, Divide- and-Conquer, and Guassian elimination. these three parallel structures cover a spectrum of variable parallelism job structures. the fork-and-join program exhibits a constant parallelism. the parallelism of the divide-and-conquer program increases initially to a maximum and then decreases progressively. In the GE job program, a job starts with its maximum parallelism and progressively decreases to 1. We present simulation results on the performance sensitivity of adaptive space sharing to parallel job structure and I/O model. © 2005 18th ISCA international conference on parallel and distributed computing systems 2005, pdcs 2005. All rights reserved.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Multi-level Loop Fusion with Mimimal Code Size 18

Multi-level Loop Fusion with Mimimal Code Size

引用

18th international conference on parallel and distributed computing systems, pdcs 2005

作者： Liu, Meilin Shao, Zili Xue, Chun Chen, Kevin F. Sha, Edwin H.-M. Department of Computer Science University of Texas at Dallas RichardsonTX75083 United States

ISBN: (纸本)9781604234565

Loop fusion is one of the most effective and common techniques to increase the performance of programs with multiple loops. the code size of the fused loop after loop fusion legalization might be increased due to the generation of the extra prologue and epilogue. Code size should be considered and minimized for embedded system designs. In this paper, we develop the Select_LF technique, which is to select one of the possible dimensions to legalize loop fusion such that the resultant code size of the fused loop is minimized. We propose a theoretical foundation to determine which dimensions are possible to be retimed to legalize loop fusion for any "J + K" model loop with a J-level outer loop and multiple K-level inner loops. the experimental results show that the execution time of the fused loops by our Select_LF technique is reduced by 55.4% on average compared to the original loops, and the code size of the fused loops is reduced by 7.8% on average compared to the previously reported Max_LF algorithm. © 2005 18th ISCA international conference on parallel and distributed computing systems 2005, pdcs 2005. All rights reserved.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Automated Implementation of Complex distributed Algorithms Specified in the IOA Language 18

Automated Implementation of Complex Distributed Algorithms S...

引用

18th international conference on parallel and distributed computing systems, pdcs 2005

作者： Georgiou, Chryssis Lynch, Nancy Mavrommatis, Panayiotis Tauber, Joshua A. Dept. of Computer Science University of Cyprus Nicosia Cyprus MIT CSAIL CambridgeMA02139 United States

ISBN: (纸本)9781604234565

IOA is a formal language for describing Input/Output automata that serves both as a formal specification language and as a programming language [14]. the IOA compiler automatically translates IOA specifications into Java code that runs on a set of workstations communicating via the Message Passing Interface. this paper describes the process of compiling IOA specifications and our experiences running several distributed algorithms. We focus on our implementation of the algorithm of Gallager, Humblet and Spira (GHS) for minimum-weight spanning tree formation in an arbitrary graph [13]. Our IOA code for GHS is derived from the Input/Output automaton description of the algorithm proved correct by Welch, Lamport, and Lynch [33]. the successful implementation of such a complicated algorithm is significant for two reasons: (a) it is an indication of the capabilities of the IOA compiler and of its advanced state of development, and (b) to the best of our knowledge, this is the first complex, distributed algorithm implemented in an automated way that has been formally and rigorously proved correct. thus, this work shows that it is possible to formally specify, prove correct, and implement complex distributed algorithms using a common formal methodology. © 2005 18th ISCA international conference on parallel and distributed computing systems 2005, pdcs 2005. All rights reserved.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

parallel Optimization: A Generalized Cellular Automata Approach 18

Parallel Optimization: A Generalized Cellular Automata Appro...

引用

18th international conference on parallel and distributed computing systems, pdcs 2005

作者： Shuai, Dianxun Wang, Wenlan Gong, Rui Wang, Xing Liu, Rongrong Department of Computer Science and Engineering East China University of Science and Technology Shanghai 200237 China

ISBN: (纸本)9781604234565

this paper presents a new generalized cellular automata (GCA) approach to effectively solve a class of optimization problems subject to a binary constraint matrix1. In contrast to the Hopfield-type neural network (HNN) and cellular neural network (CNN), the proposed GCA approach has the pyramid architecture and evolutionary dynamics related to multi-granularity macro-cells. this paper discusses the GCA’s dynamics, algorithm and properties. the simulations on the travelling salesman problems (TSP) and the fast packet switching problems (FPSP) show that the GCA approach has advantages over the HNN and CNN methods in terms of the solution quality, optimal ratio, convergence speed, real-time performance, interconnection complexity, and parameter selection. © 2005 18th ISCA international conference on parallel and distributed computing systems 2005, pdcs 2005. All rights reserved.

关键词： Packet switching

来源：评论

学校读者我要写书评

暂无评论

Efficient VSM-based parallel Text Retrieval on a PC-Cluster Environment using MPI 18

Efficient VSM-based Parallel Text Retrieval on a PC-Cluster ...

引用

18th international conference on parallel and distributed computing systems, pdcs 2005

作者： Kehagias, Dimitris Mamalis, Basilis Pantziou, Grammati Technological Educational Institution of Athens Dept. of Informatics Agiou Spyridonos Str. Aigaleo Athens12210 Greece

ISBN: (纸本)9781604234565

the design, implementation and experimental study of an efficient VSM-based parallel text retrieval method oriented to PC-Cluster environments are presented in this paper. Our approach is based on direct VSM-based indexing, distribution and retrieval methods and efficiently handles the two main problems met in this case: (a) even distribution of the computational load over the multiple processors and (b) efficient parallelization of the necessary global ranking sub-procedure, in order to gain both low response times and high speed-up values. Both the above aspects have been proved to lead to significant overheads in all the related parallel approaches in the bibliography till today. With regard to (a) we present an appropriate data sharing and balancing scheme based on ‘document clustering’, which finally leads to quite significant speed-up improvements, whereas with regard to (b) we have appropriately applied and evaluated tree-based merge-sort as well as other comparison-based sorting algorithms in order to achieve acceptably high efficiency. Additionally, our system is appropriately designed to operate both with and without the use of its built-in ‘clustering-based search mechanism’, in order to be able to perform efficient parallel selective retrieval over very large document collections. the corresponding implementation and experimental evaluation have been performed over a low/medium-cost PC-Cluster parallel environment with the use of MPI and they clearly validate the high efficiency of the suggested techniques. © 2005 18th ISCA international conference on parallel and distributed computing systems 2005, pdcs 2005. All rights reserved.

关键词： Cluster computing

来源：评论

学校读者我要写书评

暂无评论

A Cache-Aware parallel Implementation of the Push-Relabel Network Flow Algorithm and Experimental Evaluation of the Gap Relabeling Heuristic 18

A Cache-Aware Parallel Implementation of the Push-Relabel Ne...

引用

18th international conference on parallel and distributed computing systems, pdcs 2005

作者： Bader, David A. Sachdeva, Vipin College of Computing Georgia Institute of Technology AtlantaGA30332 United States Electrical and Computer Engineering Department University of New Mexico AlbuquerqueNM87106 United States

ISBN: (纸本)9781604234565

the maximum flow problem is a combinatorial problem of significant importance in a wide variety of research and commercial applications. It has been extensively studied and implemented over the past 40 years. the push-relabel method has been shown to be superior to other methods, both in theoretical bounds and in experimental implementations. Our study discusses the implementation of the push-relabel network flow algorithm on present-day symmetric multiprocessors (SMP’s) with large shared memories. the maximum flow problem is an irregular graph problem and requires frequent fine-grained locking of edges and vertices. Over a decade ago, Anderson and Setubal implemented Goldberg’s push-relabel algorithm for shared memory parallel computers;however, modern systems differ significantly from those targeted by their implementation in that SMP’s today have deep memory hierarchies and different performance costs for synchronization and fine-grained locking. Besides our new cache-aware implementation of Goldberg’s parallel algorithm for modern shared-memory parallel computers, our main new contribution is the first parallel implementation and analysis of the gap relabeling heuristic that runs from 2.1 to 4.3 times faster for sparse graphs. © 2005 18th ISCA international conference on parallel and distributed computing systems 2005, pdcs 2005. All rights reserved.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：