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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Improved asynchronous group mutual exclusion in token-passing networks

Improved asynchronous group mutual exclusion in token-passin...

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Lin, David Moh, Teng-Sheng Moh, Melody San Jose State Univ Dept Comp Sci San Jose CA 95192 USA

ISBN: (纸本)9780889866386

Group mutual exclusion (GME) was first introduced by Joung [5] as a generalization of the n-process mutual exclusion problem, and subsequently modeled as the Congenial Talking Philosophers problem. GME allows processes requesting for the same resource to concurrently access the shared resource. However, a process requesting a resource that is different from the one currently being used will not be able to access the requested resource at the same time. Two solutions to the GME problem for a ring network exist. One by Wu and Joung had an unbounded message size problem [11, 12], the second one by Cantarell, et. al. provided a bound for message size, but could potentially generate an unbounded number of messages [2, 3]. this work presents a GME algorithm for a token-passing network that solves both problems by providing a bound both to the number of messages and to message size. Analysis results of time and message complexities and of correctness are presented. Performance is evaluated by simulation experiments, which further validate complexity analyses.

关键词： distributed algorithm group mutual exclusion message passing token passing

来源：评论

学校读者我要写书评

暂无评论

Byzantine fault tolerant execution of long-running distributed applications

Byzantine fault tolerant execution of long-running distribut...

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Pallemulle, Sajeeva L. Wehrman, Ian Goldman, Kenneth J. Washington Univ Dept Comp Sci & Engn St Louis MO 63130 USA

ISBN: (纸本)9780889866386

Long-running distributed applications that automate critical decision processes require Byzantine fault tolerance to ensure progress in spite of arbitrary failures. Existing replication protocols for data servers guarantee that externally requested operations execute correctly even if a bounded number of replicas fail arbitrarily. However, since these protocols only support passive state machine replication, they are insufficient to support continued correct execution of autonomous long-running distributed applications. Building on the Castro and Liskov Byzantine Fault Tolerance protocol for replicated state machines (CLBFT), we present a practical algorithm for Byzantine fault-tolerant execution of autonomous distributed applications. the algorithm supports replicated clients that actively execute application logic by issuing operation requests on replicated data servers as well as other replicated clients. Our work facilitates dynamic upgrades to replica groups, supports both synchronous and asynchronous operation requests, and provides fault isolation between replica groups with respect to both correctness and performance. the algorithm scales well to large replica groups with only twice the latency and message complexity as compared to CLBFT, which supports only unreplicated clients.

关键词： fault tolerant systems Byzantine agreement autonomous distributed applications

来源：评论

学校读者我要写书评

暂无评论

How to improve the scalability of an industrial parallel reservoir simulator

How to improve the scalability of an industrial parallel res...

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Gratien, Jean-Marc Guignon, thomas Magras, Jean-Francois Quandalle, Philippe Ricois, Olivier IFP Energies Nouvelles 1 & 4 Av Bois Preau F-92852 Rueil Malmaison France

ISBN: (纸本)9780889866386

Reservoir Engineering industry is very interested in using ever growing dataset with more and more complex physics and detailed models. the key issue still remains running simulations in an acceptable CPU time. Regarding the trend in hardware technologies, the challenge is to improve the efficiency of reservoir simulation software on a large number of processors. New numerical difficulties and performance problems appear when the number of cells and the number of processors are growing. In this paper, we present different approaches to overcome these kinds of problems. We discuss technical choices such like advanced scalable linear solver algorithm, load balancing issue with different domain decomposition strategies, dynamic space criteria, mesh partitioner strategy and parallel solver performance management, flexible 10 strategy from simple file system to more complex parallel file system or database. We have developed and benchmarked these different solutions on published reference large scale problems and actual case studies with several tens millions of cells. We analyse the results and discuss the efficiency of each solution to overcome the scalability difficulties and performance limitations due to load unbalance.

关键词： cluster reservoir simulation solver parallel IO scalability

来源：评论

学校读者我要写书评

暂无评论

Communication-conscious mapping of regular nested loop programs onto massively parallel processor arrays

Communication-conscious mapping of regular nested loop progr...

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Siegel, Sebastian Merker, Renate Hannig, Frank Teich, Juergen Tech Univ Dresden Inst Circuits & Syst D-01062 Dresden Germany Univ Erlangen Nurnberg Dept Comp Sci 12 D-91058 Erlangen Germany

ISBN: (纸本)9780889866386

Methods for an efficient mapping of algorithms to parallel architectures are of utmost importance because many state-of-the-art embedded digital systems deploy parallelism to increase their computational power. this paper deals with the mapping of loop programs onto processor arrays implemented in an FPGA or available as (reconfigurable) coarsegrained processor architectures. Most existing work is closely related to approaches from the DSP domain and is not able to exploit the full parallelism of a given algorithm and the computational potential of a typical 2-dimensional array. In contrast, we present a mapping methodology which incorporates many important parameters of the target architecture in one approach. these are: number of processing elements, resources of the data path and memory within a processing element, and interconnection within the processor array. Based on these parameters, we formulate an optimization problem whose solution specifies an efficient mapping of an algorithm to the target architecture. We can optimize for speed of the algorithm and/or hardware cost caused by the communication and computation resources of the architecture.

关键词： processor array interconnection data path hardware mapping integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Evaluation of replication and rescheduling heuristics for grid systems with varying resource availability

Evaluation of replication and rescheduling heuristics for gr...

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Chtepen, Maria Dhoedt, Bart De Turck, Filip Demeester, Piet Claeys, Filip H. A. Vanrolleghem, Peter A. Univ Ghent INTEC Dept Informat Technol Sint Pietersnieuwstr 41 B-9000 Ghent Belgium Univ Ghent Dept Appl Math Biometr & Proc Control BIOMATH B-9000 Ghent Belgium

ISBN: (纸本)9780889866386

As grids typically consist of heterogeneously managed subsystems with strongly varying resources, resource availability should be taken into account in the job scheduling process. this paper introduces several dynamic online scheduling heuristics that reduce task loss and execution delay resulting from resource failures. ne heuristics are based upon task replication and rescheduling of failed tasks. Characteristic to the proposed methods is the relative simplicity and the efficiency with which they are dealing with dynamic grid environments. For tuning and evaluation of the algorithms, a discrete-event simulation framework was used. Grid systems with high and low system load. as well as varying failure patterns were investigated. the experiments have shown that the proposed failure detection based heuristics provide for almost lossless task execution but can decrease system performance. while replication-based algorithms generally result in good throughput on unreliable non-excessively loaded grids, however without giving a guarantee on the number of jobs lost.

关键词： grid computing dynamic scheduling task replication failure detection

来源：评论

学校读者我要写书评

暂无评论

A resource management system for data-intensive applications in desktop grid environments

A resource management system for data-intensive applications...

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Toyama, Toshiaki Yamada, Yoshito Konishi, Katsumi Kogakuin Univ Grad Sch Informat Dept Comp Sci & Commun Engn Tokyo Japan Tokyo Inst Technol Grad Sch Engn Dept Commun & Integrated Syst Tokyo Japan Kogakuin Univ Fac Informat Dept Comp Sci Tokyo Japan

ISBN: (纸本)9780889866386

Grid computing using idle desktop PCs is popular as a low-cost platform for high-throughput applications. However, they require high-cost data transfer systems from file servers to calculating nodes when very large amounts of data are handled. this high cost derives from inexpensive I/O of worker PCs and small inexpensive file systems of desktop grid computing. this work describes a desktop grid computing system and proposes a resource management system for volume visualization. the resource management system proposed in this work overcomes problems with high-cost data transfer and helps us to use desktop grid computing for data-intensive applications. the resource management system provides efficient scheduling while considering the data file location and consists of three technical parts: resource management, multiple data replication, and worker selection. the proposed system uses these techniques to make an intelligent reuse of data which has been previously copied. this paper evaluates the proposed system compared with a traditional system that does not consider data file location. the proposed resource management System provides efficient scheduling and appears to achieve good performance for data-intensive applications.

关键词： desktop grid computing PC grid resource management data-intensive applications volume visualization parallel visualization

来源：评论

学校读者我要写书评

暂无评论

A case study on grid performance modeling

A case study on grid performance modeling

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Lu, Baochuan Apon, Amy Dowdy, Larry Robinson, Frank Hoffman, Doug Brewer, Denny Univ Arkansas Comp Sci & Comp Engn Fayetteville AR 72701 USA Vanderbilt Univ Elect Engn & Comp Sci Nashville TN 37235 USA Acxiom Corp Conway AR USA

ISBN: (纸本)9780889866386

the purpose of this case study is to develop a performance model for an enterprise grid for performance management grid capacity planning(1). the target environment includes,grid applications such as health-care arid financial services where the data is located primarily within the resources of a worldwide corporation. the approach is to build a discrete event simulation model for a representative work-flow grid. Five work-flow classes, found using a customized k-means clustering algorithm characterize the workload of the grid. Analyzing the gap between the simulation arid measurement data validates the model. the case study demonstrates that the simulation model can be used to predict the V a given a workload forecast. the,rid system performance model is also used to evaluate alternative scheduling strategies. the simulation model is flexible arid easily incorporates several system details.

关键词： grid computing performance modelling capacity planning discrete-event simulation JavaSim case study

来源：评论

学校读者我要写书评

暂无评论

Power-aware parametric dispatching in distributed real-time systems

Power-aware parametric dispatching in distributed real-time ...

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Elsharkawy, Sameh M. Younis, Mohamed F. Moulds, Clint Catholic Univ Amer Dept Elect Engn & Comp Sci Washington DC 20064 USA Univ Maryland Baltimore Cty Dept Elect Engn & Comp Sci Baltimore MD 21228 USA

ISBN: (纸本)9780889866386

the majority of battery operated computing devices have the capability to employ Dynamic Voltage Scaling (DVS) as an effective method to minimize the power used by their processors. Algorithms employing DVS in real-time systems must guarantee the satisfaction of all tasks' timing constraints while minimizing power consumption. In this paper, we present a framework for scheduling and dispatching a distributed set of hard real-time tasks with relative timing constraints. In our approach, the scheduler employs the parametric real-time scheduling methodology to provide on-time completion guarantees for periodic hard real-time tasks. Moreover, the scheduler associates with each hard real-time task a feasibility range parameterized by timing parameters generated at run-time. the run-time dispatcher uses this information to calculate the system's dynamic slack time. It uses the slack time to set the CPU speed using DVS in the time interval till the next scheduling point. the dispatcher reclaims the additional slack generated when a job uses fewer execution cycles than its worst-case estimate to further reduce power consumption. the proposed power-aware dispatching method has running-time of O(1) with no need for off-line computations. Our simulation results show significant improvement in power savings over previously presented DVS-based scheduling methods.

关键词： real-time scheduling power management Digital Voltage Scaling distributed systems parametric dispatching

来源：评论

学校读者我要写书评

暂无评论

Design of the SAgent security framework for JADE

Design of the SAgent security framework for JADE

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Gunupudi, Vandana Tate, Stephen R. Univ North Texas Dept Comp Sci & Engn Denton TX 76203 USA

ISBN: (纸本)9780889866386

In this paper, we present the design of SAgent, a general-purpose mobile agent security framework. SAgent is designed for comprehensive protection of mobile agent computations and data in potentially hostile environments and works with the JADE (Java Agent DEvelopment) platform [1], a FIPA-compliant multi-agent environment. Using good software engineering design techniques of software reusability and abstraction, SAgent allows agent protection protocols and applications to be developed independently of each other. To accomplish this, a clean conceptual framework is presented which encapsulates in several general class interfaces the common security functionality required by secure agent applications. Since SAgent is designed to generically protect the computations of mobile agent applications, we provide implementations of two secure multiagent protocols that protect the confidentiality of agent data as well as implementations of four methods that protect the integrity of mobile agent data. Experimental results showing the feasibility of these methods are available in separate publications [2] [3]. the goal of SAgent is to provide a framework where proposed theoretical techniques can be used and experimentally evaluated. SAgent allows a new security provider to implement and experiment with new techniques for protecting mobile agents in a well-defined manner and is generic enough to support both software-based and hardware-based protections.

关键词： software development software reuse distributed agents mobile agent security frameworks for mobile agents

来源：评论

学校读者我要写书评

暂无评论

Approximating the Buffer Allocation Problem using epochs

Approximating the Buffer Allocation Problem using epochs

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Pedersen, Jan Baekgaard Brodsky, Alex Univ Nevada Sch Comp Sci 4505 Maryland Pkwy Las Vegas NV 89154 USA Univ Winnipeg Dept Appl Comp Sci Winnipeg MB R3B 2E9 Canada

ISBN: (纸本)9780889866386

the correctness of applications that perform asynchronous message passing typically relies on the underlying hardware having a sufficient amount of memory (message buffers) to hold all undelivered messages-such applications may deadlock when executed on a system with an insufficient number of message buffers. thus, determining the minimum number of buffers that an application needs to prevent deadlock is an important task when writing or porting parallel applications. Unfortunately, both this problem (called the Buffer Allocation Problem) and the simpler problem of determining whether an application may deadlock for a given number of available message buffers are intractable [1]. We present a new epoch-based polynomial-time approach for approximating the Buffer Allocation Problem. Our approach partitions application executions into epochs and intersperses barrier synchronizations between them, thus limiting the number of message buffers necessary to ensure deadlock-freedom. this approach produces near optimal solutions for many common cases and can be adapted to guide application modifications that ensure deadlock freedom when the application is ported. Lastly, we describe a space-time trade-off between the number of available message buffers and the number of barrier synchronizations, and describe how this trade-off can be used to fine-tune application performance.

关键词： resource allocation parallel programming message passing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：