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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

991 篇 会议
19 篇 期刊文献
9 册 图书

馆藏范围

1,019 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

763 篇 工学
- 735 篇 计算机科学与技术...
- 525 篇 软件工程
- 195 篇 信息与通信工程
- 78 篇 控制科学与工程
- 59 篇 电子科学与技术（可...
- 58 篇 电气工程
- 21 篇 动力工程及工程热...
- 19 篇 机械工程
- 16 篇 生物医学工程（可授...
- 15 篇 生物工程
- 13 篇 建筑学
- 12 篇 环境科学与工程（可...
- 11 篇 安全科学与工程
- 8 篇 仪器科学与技术
- 7 篇 化学工程与技术
- 6 篇 力学（可授工学、理...
- 6 篇 光学工程
- 6 篇 土木工程
256 篇 理学
- 209 篇 数学
- 34 篇 统计学（可授理学、...
- 31 篇 系统科学
- 21 篇 物理学
- 20 篇 生物学
- 12 篇 化学
221 篇 管理学
- 170 篇 管理科学与工程(可...
- 111 篇 工商管理
- 67 篇 图书情报与档案管...
14 篇 经济学
- 14 篇 应用经济学
10 篇 法学
- 7 篇 社会学
6 篇 医学
- 6 篇 基础医学(可授医学...
4 篇 农学
3 篇 文学
2 篇 教育学

主题

95 篇 distributed comp...
71 篇 parallel process...
53 篇 grid computing
50 篇 peer to peer com...
48 篇 distributed comp...
33 篇 parallel process...
32 篇 servers
31 篇 fault tolerance
30 篇 computer archite...
29 篇 computational mo...
27 篇 distributed data...
24 篇 protocols
21 篇 concurrent compu...
21 篇 software enginee...
21 篇 cloud computing
19 篇 parallel program...
18 篇 graphics process...
18 篇 algorithm design...
18 篇 artificial intel...
17 篇 bandwidth

机构

11 篇 institute of com...
10 篇 institute of com...
5 篇 academic center ...
5 篇 department of in...
4 篇 institute of par...
4 篇 national laborat...
4 篇 graduate univers...
4 篇 national laborat...
3 篇 school of comput...
3 篇 chinese academy ...
3 篇 institute of inf...
3 篇 chinese academy ...
3 篇 school of comput...
3 篇 computer science...
2 篇 pervasive techno...
2 篇 inria
2 篇 disca univ. poli...
2 篇 state key labora...
2 篇 west bengal univ...
2 篇 dcse college of ...

作者

7 篇 valentin cristea
5 篇 kurt rothermel
5 篇 nakashima hirosh...
5 篇 kondo toshio
5 篇 sasaki takahiro
5 篇 ohno kazuhiko
5 篇 gonzalez teofilo...
4 篇 tang tao
4 篇 wang guibin
4 篇 florin pop
4 篇 matsumoto masaki
4 篇 andresen daniel
3 篇 suter frédéric
3 篇 dongarra jack
3 篇 kawamura takao
3 篇 xhafa fatos
3 篇 alexandru costan
3 篇 lin yisong
3 篇 cristea valentin
3 篇 takata toyoo

语言

1,000 篇 英文
19 篇 其他

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

共 1019 条记录，以下是121-130 订阅

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

详细简洁

排序：

Topologically adaptive parallel breadth-first search on multicore processors

Topologically adaptive parallel breadth-first search on mult...

引用

21st iasted international conference on parallel and distributed computing and systems, pdcs 2009

作者： Xia, Yinglong Prasanna, Viktor K. Computer Science Department University of Southern California Los Angeles CA 90007 United States Ming Hsieh Department of Electrical Engineering University of Southern California Los Angeles CA 90007 United States

ISBN: (纸本)9780889868113

Breadth-first Search (BFS) is a fundamental graph theory algorithm that is extensively used to abstract various challenging computational problems. Due to the fine-grained irregular memory accesses, parallelization of BFS can exhibit limited performance on cache-based systems. In this paper, we study the relationship between the topology of input graphs and the performance of BFS on multicore systems. We propose a model to estimate the scalability of BFS with respect to a given graph. Using this model, we propose a topologically adaptive parallel BFS algorithm on multicore systems. The proposed algorithm estimates scalability of each iteration of BFS with respect to the input graph at runtime. An adaptive barrier is developed for this algorithm, which dynamically adjusts the number of threads participating in the BFS according to the estimated scalability. In this way, we reduce the synchronization overhead. We evaluate the proposed algorithm using various graphs on state-of-the-art multicore systems. The proposed method exhibits improved performance compared with traditional parallel BFS algorithms for which the number of threads is fixed.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

Memory utilization analysis of Java middleware for distributed real-time and embedded systems

Memory utilization analysis of Java middleware for distribut...

引用

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

作者： Qu, Runtao Hirano, Satoshi Ohkawa, Takeshi AIST Natl Inst Adv Ind Sci & Technol Informat Technol Res Inst AIST Tsukuba Cent 2 Tsukuba Ibaraki 3058568 Japan

ISBN: (纸本)9780889866386

distributed object-oriented middleware technologies have been adopted for ubiquitous communicating real-time and embedded systems. Although Java plays an important role in building distributed object-oriented middleware because of its portability and productivity, it is not popularto real-time system developers because it is slow and hard to keep real-timeness due to garbage collection. This paper presents a novel memory classification and measurement approach for modem programming language such as Java to analyze the memory utilization of middleware technologies in order to improve them for embedded systems using limited computing resource. We classified Java memory into four categories such as static, quasi-static, quasi-dynamic and dynamic, and show how to measure the size of each memory. Intensive case studies using popular Java middleware technologies such as Web Services, CORBA, RMI and HORB revealed that reducing the use of dynamic memory has contributed far more to the efficiency and performance than reducing the use of quasi-static and quasi-dynamic memory.

关键词： memory analysis Java middleware distributed system

来源：评论

学校读者我要写书评

暂无评论

Investigating the replica transfer scheduling problem

Investigating the replica transfer scheduling problem

引用

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

作者： Loukopoulos, Thanasis Tziritas, Nikos Lampsas, Petros Lalis, Spyros Univ Thessaly Dept Comp & Commun Engn Glavani 37 Volos 38221 Greece

ISBN: (纸本)9780889866386

The Replica Placement Problem (RPP) aims at selecting the nodes for duplicating data objects in order to optimize their access. Even though a lot of work already exists on RPP, the issue of implementing the resulting allocation scheme is typically overlooked. In this paper we introduce the Replica Transfer Scheduling Problem (RTSP), briefly stated as: given a network of servers with limited storage capacitv, a set of data objects and two replication schemes x(old) and X-new, find a schedule of object transfers and deletions for implementing X-old based on X-old with minimum communication cost. Given that this problem is NP-complete, we introduce several different heuristics to solve it, and evaluate them via simulations.

关键词： replica placement replica transfers distributed systems

来源：评论

学校读者我要写书评

暂无评论

Janet's Abstract distributed Service Component

Janet's Abstract Distributed Service Component

引用

Proceedings of the Fifteenth iasted international conference on parallel and distributed computing and systems

作者： Cappello, Peter Department of Computer Science Univ. of California Santa Barbara Santa Barbara CA 93106 United States

We motivate the value of an abstract distributed service component (ADSC) with an overview of JANET, a high-performance grid computing service. We then present the architecture of an ADSC, focusing on some design issues.

ISBN: (纸本)088986392X

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic evolution in a survivable application infrastructure

Dynamic evolution in a survivable application infrastructure

引用

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

作者： Thorvaldsson, Haraldur D. Goldman, Kenneth J. Washington Univ Dept Comp Sci & Engn St Louis MO 63130 USA

ISBN: (纸本)9780889866386

We describe a highly scalable algorithm for secure system evolution in an infrastructure for widely distributed Byzantine fault-tolerant applications. To maintain high availability, the system and its applications evolve on-line, providing uninterrupted service during installation of upgrades. Installations are made to appear atomic with respect to other installations and application execution steps. Our algorithm guarantees safe installation despite Byzantine faulty replicas and replica groups. An initial phase prepares replica groups for an upgrade, while a second phase triggers the installation of the upgrade by gossip among groups. A simple but novel scheme using secret sharing and Byzantine quorums prevents faulty replicas and replica groups from disrupting or maliciously exploiting installations. Installation message complexity and computational complexity grow linearly with the number of replicas.

关键词： fault tolerant systems dynamic evolution configurable distributed systems Byzantine fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Optimal scheduling of task graphs on parallel systems

Optimal scheduling of task graphs on parallel systems

引用

international conference on parallel and distributed computing and Networks

作者： Sinnen, Oliver Kozlov, Alexci Vladimirovich Shahul, Ahmed Zaki Semar Univ Auckland Dept Elect & Comp Engn Private Bag 92019 Auckland New Zealand

ISBN: (纸本)9780889866379

Scheduling tasks onto the processors of a parallel system is a crucial part of program parallelisation. Due to the NP-hardness of the task scheduling problem, scheduling algorithms are based on heuristics that try to produce good rather than optimal schedules. Nevertheless, in certain situations it is desirable to have optimal schedules, for example for time critical systems or to evaluate scheduling heuristics. This paper proposes a scheduling algorithm based on A* that can produce optimal schedules in reasonable time for small task graphs. A* is a best-first state space search algorithm. In comparison to a previous approach, the here presented scheduling algorithm has a significantly reduced search space due to a much improved cost function f (s) and additional pruning techniques. Experimental results reveal the relation between the runtime of the algorithm and the structure of the task graphs. Further, it is shown that the proposed algorithm significantly outperforms the previous approach.

关键词： scheduling task graphs optimal schedules A

来源：评论

学校读者我要写书评

暂无评论

Synchronizing data stream processing

Synchronizing data stream processing

引用

international conference on parallel and distributed computing and Networks

作者： Qureshi, Muhammad S. F. Getta, Janusz R. Univ Wollongong Sch IT & Comp Sci Wollongong NSW 2522 Australia

ISBN: (纸本)9780889866379

Synchronization of data stream processing has a significant impact on performance of systems where processing of long sequences of data items needs to be done simultaneously. In earlier works on stream processing, synchronization has been discussed to a limited extent or has been completely overlooked. This work describes a formal model of synchronization in a data stream processing network. We use a notation of data stream processing networks to identify circumstances that necessitate synchronization and express processing of data items in a data stream processing network in terms of database transactions. A technique similar to timestamp ordering of database transactions is used to solve the problems. A solution is presented as a set of rules that govern processing of individual data items. A proof of correctness for the strategy used is also provided.

关键词： data stream synchronization parallel processing transaction timestamp

来源：评论

学校读者我要写书评

暂无评论

A two-phase scheduling approach for grid computing

A two-phase scheduling approach for grid computing

引用

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

作者： Dong, Fangpeng Akl, Selim G. Queens Univ Sch Comp Kingston ON K7M 1B6 Canada

ISBN: (纸本)9780889866386

Resources in the computational Grid nowadays are usually owned by multiple administrative domains which are connected by WANs. Grid resources have their own local management policies and a Grid scheduler cannot control resources beyond the domain of itself. Scheduling algorithms designed for traditional systems do not consider these new characteristics in Grids. In this paper, a two-phase scheduling approach for DAG-based applications in the Grid is proposed. In the first phase, the task graph is partitioned according to the status of selected available resource clusters by an algorithm called GPRC. In the second phase, an algorithm called HEFT is used to map task nodes to processing nodes inside a resource cluster. GPRC does not require detailed status information or control privilege on every Grid resource so that the dependence on Grid information services is reduced and, at the same time, the higher priority of local resource management policies is respected. Analysis and experiment show the effectiveness and adaptation of this new approach in the Grid scenario.

关键词： task scheduling grid computing DAG

来源：评论

学校读者我要写书评

暂无评论

Averages, distributions and scalability of mpi communication times for ethernet and myrinet networks

Averages, distributions and scalability of mpi communication...

引用

international conference on parallel and distributed computing and Networks

作者： Hamid, Nor Asilah Wati Abdul Coddington, Paul Univ Adelaide Sch Comp Sci Adelaide SA 5005 Australia

ISBN: (纸本)9780889866379

Most modem parallel computers are clusters using Myrinet or Ethernet communication networks. Several studies have been published comparing the performance of these two networks for parallel computing, however these focus on average performance, and do not address the distributions of communication times, which can have long tails due to contention effects. In the case of Ethernet with TCP, retransmit timeouts (RTOs) can also occur. Slow communication events may have significant impact, particularly for applications requiring frequent synchronization, where the performance is determined by the slowest process. We have analysed the distributions of communication times for standard MPI routines on Ethernet with TCP and Myrinet with GM communications networks on the same cluster, and studied the scalability of the distributions as the number of communicating processes is increased, and the effect of RTOs for Ethernet with TCP.

关键词： MPI benchmarks parallel computer network performance

来源：评论

学校读者我要写书评

暂无评论

Adaptive grid computing for MPI applications

Adaptive grid computing for MPI applications

引用

21st iasted international conference on parallel and distributed computing and systems, pdcs 2009

作者： Zhang, Juemin Meleis, Waleed Department of Electrical and Computer Engineering Northeastern University Boston MA 02115 United States

ISBN: (纸本)9780889868113

Our objective is to provide location-, topology-, and administrative- transparent grid computing forMPI applications, while hiding the physical details of computing platforms and heterogeneous networks fromthe application elopers and users. To achieve this objective, we introduced a new resource allocation model, workflow structures to specify MPI applications involving multiple tasks, and message relay to enable communication across different networks. We eloped the SGR framework, which integrates workflow scheduling, task grouping, and message relay services, while hiding resource allocation, heterogeneous networks, and decentralized resource management systems from application elopers and users. The SGR system has been implemented on a Globus-enabled computing grid. We created a simulation environment to investigate our model and various schedulers. Using the findings from simulation, we implemented the SGR framework and tested the model's implementation on a two-cluster grid. We observed that duplication can improve performance by more than 15%, which matches our simulation results. Moreover, we evaluated our new message relay service for cross-site message passing. The test results indicate that although the SGR's message relay service has some communication overhead, the system is scalable with respect to the number of processes and the message size.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：