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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

117 篇 会议
3 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

71 篇 工学
- 67 篇 计算机科学与技术...
- 23 篇 软件工程
- 7 篇 电气工程
- 6 篇 信息与通信工程
- 5 篇 电子科学与技术（可...
- 2 篇 控制科学与工程
- 1 篇 光学工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
14 篇 理学
- 13 篇 数学
- 1 篇 生物学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
11 篇 管理学
- 11 篇 管理科学与工程(可...
- 5 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 教育学
- 1 篇 教育学

主题

19 篇 grid computing
16 篇 concurrent compu...
15 篇 distributed comp...
12 篇 parallel process...
11 篇 computer science
9 篇 parallel process...
9 篇 computer archite...
9 篇 processor schedu...
9 篇 clustering algor...
8 篇 delay
7 篇 application soft...
7 篇 computational mo...
7 篇 computer network...
7 篇 distributed comp...
6 篇 costs
6 篇 large-scale syst...
5 篇 parallel algorit...
5 篇 runtime
5 篇 peer to peer com...
5 篇 scheduling algor...

机构

3 篇 institute of com...
3 篇 univ coll dublin...
3 篇 polish japanese ...
2 篇 ericsson ab kist...
2 篇 inesc-id lisboa
2 篇 ibm deutschland ...
2 篇 polish japanese ...
2 篇 usn postgrad sch...
2 篇 laboratoire d'in...
2 篇 hiroshima univ d...
2 篇 natl univ irelan...
2 篇 univ connecticut...
2 篇 univ cyprus dept...
1 篇 laboratoire de r...
1 篇 department of co...
1 篇 supercomputing c...
1 篇 irisa/inria pari...
1 篇 center for embed...
1 篇 inesc id p-9 lis...
1 篇 laboratoire d'in...

作者

4 篇 m. tudruj
3 篇 l. masko
2 篇 ito yasuaki
2 篇 kechadi m-tahar
2 篇 lastovetsky alex...
2 篇 j. borkowski
2 篇 savvas ik
2 篇 musial peter m.
2 篇 nakano koji
2 篇 d. grigoras
2 篇 tudruj m
2 篇 s. yamagiwa
2 篇 shvartsman alexa...
2 篇 kechadi mt
2 篇 georgiou chryssi...
1 篇 hameurlain a
1 篇 macariu georgian...
1 篇 yamagiwa s
1 篇 park cy
1 篇 schreiner wolfga...

语言

120 篇 英文

检索条件"任意字段=ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing"

共 120 条记录，以下是81-90 订阅

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

详细简洁

排序：

SSOR Preconditioned Conjugate Gradient Algorithm in Dynamic SMP Clusters with Communication on the Fly

SSOR Preconditioned Conjugate Gradient Algorithm in Dynamic ...

引用

international symposium on parallel and distributed computing

作者： C. Vollaire L. Nicolas L. Masko M. Tudruj B. Butrylo Bialystok Tech. Univ.

the paper concerns efficient parallel computation methods for solving matrix linear equations using the preconditioned conjugate gradient method. Efficient parallelization methods of the preconditioner module have been proposed based on execution in a special architecture of dynamically reconfigurable shared memory clusters. the assumed system is provided with a novel efficient inter-processor communication technique called communication on the fly, which is very suitable for fine grain parallel computations. Two-step parallel data decomposition is implemented in the elaborated preconditioner, which leads to the decrease of computation grain and overlapping of communication with computations. Comparative experimental results are presented of program execution efficiency in a standard distributed multicomputer cluster based on message passing and in the architecture of dynamic SMP clusters with the communication on the fly

关键词： Clustering algorithms Heuristic algorithms Concurrent computing Computer architecture Iterative algorithms Equations Gradient methods Message passing Numerical analysis Electromagnetic fields

来源：评论

学校读者我要写书评

暂无评论

On the Implementation and Evaluation of Berkeley Sockets on Maestro2 cluster computing environment

On the Implementation and Evaluation of Berkeley Sockets on ...

引用

international symposium on parallel and distributed computing

作者： R. Guapo L. Sousa S. Yamagiwa Instituto Superior Técnico Lisboa Portugal INESC-ID Lisboa Portugal

the support on cluster environments of "legacy protocols" is important to avoid rewriting the code of applications, but this support should not prevent achieving the maximum communication performance. this paper addresses this issue by implementing the Berkeley sockets interface over the MMP message passing protocol, which is the lower layer of the Maestro2 cluster communication network. Experimental results show that MMP-Sockets offers a minimum latency of 25mus and a maximum throughput of 1250Mbps. these values correspond to a relative increase of 80% for the latency and a decrease of about 30% for the throughput, regarding to a communication based only on MMP. However, MMP-Sockets increases the compatibility and portability of developed applications

关键词： Sockets Application software Protocols Hardware Software performance Message passing Software libraries Delay throughput Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

A Strategyproof Mechanism for Scheduling Divisible Loads in distributed Systems

A Strategyproof Mechanism for Scheduling Divisible Loads in ...

引用

international symposium on parallel and distributed computing

作者： D. Grosu T.E. Carroll Department of Computer Science Wayne State University Detroit MI USA

An important scheduling problem is the one in which there are no dependencies between tasks and the tasks can be of arbitrary size. this is known as the divisible load scheduling problem and was studied extensively resulting in a cohesive theory called divisible load theory (DLT). In this paper, we augment the existing divisible load theory with incentives. We develop a strategyproof mechanism for scheduling divisible loads in distributed systems assuming a bus type interconnection and a linear cost model for the processors. the mechanism provides incentives to processors such that it is beneficial for them to report their true processing power and process the assigned load using their full processing capacity. We define the strategyproof mechanism and prove its properties. We simulate and study the implementation of the mechanism on systems characterized by different parameters

关键词： Processor scheduling distributed computing Scheduling algorithm Protocols Cost accounting Computational modeling Concurrent computing Computer science Power system interconnection Power system modeling

来源：评论

学校读者我要写书评

暂无评论

A Comparative Simulation Analysis of P2P System Architectures

A Comparative Simulation Analysis of P2P System Architecture...

引用

international symposium on parallel and distributed computing

作者： A. Mahanta T. theeramunkong Sirindhorn International Institute of Technology Thammasat University Mueang Pathum Thani Thailand

this paper gives a comparative study on multilayer file sharing mechanisms in peer-to-peer (P2P) systems. Based on a well-known P2P system named Gnutella, two system architectures, 1-layer and 2-layer Ngnu architectures are proposed in order to reduce network traffic and to gain better scalability. these architectures can be applied to large-scale systems, such as e-government, e-office and e-library, which need an efficient file-sharing mechanism. To examine the efficiency and effectiveness of the proposed methods, a number of simulations are made with respect to three factors: time-to-lives (TTLs), the number of nodes and the number of queries. To compare these systems, the number of messages and the mean query hit are measured and compared with the original flat Gnutella system

关键词： Analytical models Peer to peer computing Computer networks Scalability Computer architecture Costs Collaboration distributed computing Protocols Security

来源：评论

学校读者我要写书评

暂无评论

Towards Massively parallel Numerical Computations Based on Dynamic SMP Clusters with Communication on the Fly

Towards Massively Parallel Numerical Computations Based on D...

引用

international symposium on parallel and distributed computing

作者： M. Tudruj L. Masko Polish Japanese Institute of Information Technology Warsaw Poland Institute of Computer Science Polish Academy of Sciences Warsaw Poland

the paper presents an analysis of the suitability of the architecture of dynamic SMP clusters with communication on the fly for massively parallel fine grain numerical computations. It is assumed that the proposed architecture is implemented using the highly modular "system on chip" and "network on chip" technology. this technology is considered to provide soon a very large number of co-operating processors embedded in a single parallel system, thus enabling massively parallel computations. the proposed architecture of dynamic clusters with communication on the fly meets requirements of large scale fine grain computations and can be successfully applied in this technology. Experimental simulation results are presented concerning efficiency of fine grain parallel implementation of a typical numerical problem which is matrix multiplication based on recursive data decomposition. Selection of optimal parallel computation grain is discussed. Estimations of the efficiency of the proposed methods for fine grain computations for large problem size are presented

关键词： Concurrent computing Computer architecture Network-on-a-chip Embedded computing parallel processing System-on-a-chip Very large scale integration Computer science Information technology Information analysis

来源：评论

学校读者我要写书评

暂无评论

A distributed Algorithm for the Maximum Flow Problem

A Distributed Algorithm for the Maximum Flow Problem

引用

international symposium on parallel and distributed computing

作者： thuy Lien Pham I. Lavallee M. Bui Si Hoang Do Laboratoire de Recherche en Informatique Avancée Université Paris 8 Paris France

this paper presents an asynchronous distributed algorithm for solving the maximum flow problem which is based on the preflow-push approach of Golberg-Tarjan. Each node in graph initially knows the capacities of outgoing and incoming adjacent arcs, the source nodes knows additionally the number of nodes in graph. Nodes execute the same algorithm, and exchange messages with neighbors until the maximum flow is established. the algorithm is applicable in cases of multiple sources and/or targets. We give also here some ideas to adjust our algorithm to dynamic changes of arc capacities. For a graph of n nodes and m arcs, our algorithm takes O(n 2 m) message complexity and O(n 2 ) time complexity

关键词： distributed algorithms Irrigation Labeling Heuristic algorithms Fluid flow Transportation Mobile ad hoc networks Books Algorithm design and analysis Bidirectional control

来源：评论

学校读者我要写书评

暂无评论

Profiling Macro Data Flow Graphs for parallel Implementation of FDTD Computations

Profiling Macro Data Flow Graphs for Parallel Implementation...

引用

international symposium on parallel and distributed computing

作者： A. Smyk M. Tudruj Polish Japanese Institute of Information Technology Warsaw Poland Institute of Computer Science Polish Academy of Sciences Warsaw Poland

In this paper, we present methodology, which enables designing and profiling macro data flow graphs that represent computation and communication patterns for the FDTD (finite difference time domain) problem in irregular computational areas. Optimized macro dataflow graphs (MDFG) for FDTD computations are generated in three main phases: generation of initial MDFG based on wave propagation area partitioning, MDFG nodes merging with load balancing to obtain given number of macro nodes and communication optimization to minimize and balance internode data transmissions. the computation efficiency for several communication systems (MPI, RDMA RB, SHMEM) is discussed. Relations between communication optimization algorithms and overall FDTD computation efficiency are shown. Experimental results obtained by simulation are presented

关键词： Data flow computing Flow graphs Finite difference methods Time domain analysis Concurrent computing Design methodology Merging Load management Data communication Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Embedded cost model in mobile agents for large scale query optimization

Embedded cost model in mobile agents for large scale query o...

引用

international symposium on parallel and distributed computing

作者： M. Hussein F. Morvan A. Hameurlain Institut de Recherche en Inforrnatique de Toulouse IRIT Université Paul Sabatier Toulouse France

Execution plans generated by traditional optimizers for large scale distributed queries can be sub-optimal because: the estimations are inaccurate, the data are unavailable and the execution environment is unstable. To deal with the sub-optimality, we propose to execute each relational operator of an execution plan by a mobile agent. A mobile agent can change its execution site in order to correct the sub-optimality. In this paper, we address the problem of choosing an execution site for a mobile agent among execution sites of the considered system. For this, we propose to integrate a cost model into the mobile agents. We define also the various interactions that might occur between a mobile agent and its execution site. the performance evaluation shows that the cost model embedded in the agent allows to choose the most appropriate execution site

关键词： Cost function Mobile agents Large-scale systems Query processing Delay Bandwidth Estimation error distributed databases IP networks Data structures

来源：评论

学校读者我要写书评

暂无评论

Developing a Consistent Domain-Oriented distributed Object Service

Developing a Consistent Domain-Oriented Distributed Object S...

引用

4th IEEE international symposium on Network computing and Applications (NCA 2005)

作者： Georgiou, Chryssis Musial, Peter M. Shvartsman, Alexander A. Univ Cyprus Dept Comp Sci CY-1678 Nicosia Cyprus USN Postgrad Sch Dept Comp Sci Monterey CA 93943 USA Univ Connecticut Dept Comp Sci & Engn Storrs CT 06269 USA

ISBN: (纸本)0769523269

this paper presents a new algorithm for a reconfigurable distributed domain-oriented atomic object service, called DO-RAMBO, which stands for Domain-Oriented Reconfigurable Atomic Memory for Basic Objects. this service is suitable for inclusion as a middleware system service for distributed applications requiring atomic read/write data. the implementation substantially extends and refines the abstract RAMBO algorithm of Lynch and Shvartsman that supports individual atomic objects. In this paper, domains are introduced to allow the users to group related atomic objects. the new implementation manages configurations on the basis of domains, significantly improving the utility and the performance of the resulting service. DO-RAMBO guarantees consistency under asynchrony, message loss, node crashes, new node arrivals, and node departures. We present the formal algorithm development for DO-RAMBO and give analytical and empirical results that illustrate the benefit of the new approach.

关键词： distributed systems specifying and verifying and reasoning about programs algorithm and design analysis reliability and robustness

来源：评论

学校读者我要写书评

暂无评论

A Component-based Software Infrastructure for Ubiquitous computing

A Component-based Software Infrastructure for Ubiquitous Com...

引用

international symposium on parallel and distributed computing

作者： A. Flissi C. Gransart P. Merle LIFL/CNRS Villeneuve d'Ascq France INRETS/LEOST Villeneuve d'Ascq France INRIA-LIFL Villeneuve d'Ascq France

Multiplication of mobile devices and generalized use of wireless networks imply changes on the design and execution of distributed software applications targeting ubiquitous computing. Many strong requirements have to be addressed: heterogeneity and limited resources of wireless networks and mobile devices, networked communications between distributed applications, dynamic discovery and automatic deployment on mobile devices. In this paper, we present a component-based software infrastructure to design, discover, deploy, and execute ubiquitous contextual services, i.e. distributed applications providing services to mobile end-users but only available from a particular place. these ubiquitous contextual services are designed as assemblies of distributed software components. these assemblies are dynamically discovered according to end-users' physical location and device capabilities. then, appropriate assemblies are automatically deployed on users' devices. We have implemented this approach (the software infrastructure and a ubiquitous application example) on top of the OMG CORBA Component Model and the OpenCCM open source platform

关键词： Ubiquitous computing Application software Assembly Wireless networks Context-aware services Context Open source software Mobile computing Mobile communication Software design

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共12页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：