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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
20 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

764 篇 工学
- 736 篇 计算机科学与技术...
- 526 篇 软件工程
- 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 篇 dongarra jack
4 篇 tang tao
4 篇 wang guibin
4 篇 florin pop
4 篇 matsumoto masaki
4 篇 andresen daniel
3 篇 suter frédéric
3 篇 kawamura takao
3 篇 xhafa fatos
3 篇 alexandru costan
3 篇 lin yisong
3 篇 cristea valentin
3 篇 takata toyoo

语言

1,001 篇 英文
19 篇 其他

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

共 1020 条记录，以下是661-670 订阅

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

详细简洁

排序：

Self-tuned passive testers for grey-box distributed systems with indefinite communication delays

Self-tuned passive testers for grey-box distributed systems ...

引用

international conference on parallel and distributed computing and Networks

作者： Brzezinski, Krzysztof M. Malinski, Norbert Warsaw Univ Technol Inst Telecommun Nowowiejska 15-19 PL-00665 Warsaw Poland

ISBN: (纸本)9780889866379

Passive testing is a technique suitable for continuous, non-intrusive, autonomous testing of qualitative behavioural properties (correctness) of a deployed distributed system. A real passive tester has to face observational uncertainty, which may lead to false verdicts. We submit the novel idea of a self-tuned passive tester, which is able to adapt to a priori unknown, and possibly changing delays in communication channels. We propose the structure and algorithms of a passive tester that "tunes itself" basing solely on its own, locally issued verdicts. This seemingly counter-intuitive principle is shown by simulation to be viable and effective.

关键词： protocols algorithms modelling and simulation testing

来源：评论

学校读者我要写书评

暂无评论

A comparative study of peer to peer dynamic load balancing on embedded topologies

A comparative study of peer to peer dynamic load balancing o...

引用

international conference on parallel and distributed computing and Networks

作者： Akhtar, Muhammad Waseem Kechadi, M-Tahar Univ Coll Dublin Sch Comp Sci & Informat Dublin 4 Ireland

ISBN: (纸本)9780889866379

In this study we evaluate and compare the performance of our load balancing technique on irregular P2P systems embedded in two regular topologies: 1) Hypercube and 2) TreeP. Hypercube is one of the most studied interconnection topologies and exhibits powerful interconnection features, while TreeP is Tree-based P2P network architecture and is based on a tessellation of a 1-D space. The load balancing technique employed is a two step strategy. In the first phase, it maps any irregular network topology to a regular one. In the second phase the load is balanced among the nodes using PSLB algorithm. In this paper we study and compare the performance of this two-step strategy on hypercube and TreeP topologies. This strategy is proven to be efficient and does not introduce a considerable overhead as shown in the experimental results.

关键词： parallel computing systems dynamic load balancing P2P systems grid systems graph embedding

来源：评论

学校读者我要写书评

暂无评论

Active and passive replication of multimedia content in a proxy-to-proxy network (X2X)

Active and passive replication of multimedia content in a pr...

引用

international conference on parallel and distributed computing and Networks

作者： Spielvogel, Christian Boeszoermenyi, Laszlo Univ Klagenfurt Inst Informat Technol Klagenfurt Austria

ISBN: (纸本)9780889866379

Active and passive replication are powerful techniques to improve the quality of multimedia streaming. Most systems follow either the active or the passive approach. A well known example for active replication are Content Distribution Networks [8] that replicate data to predefined static locations. In contrast to that, P2P file sharing networks [2, 1] use passive replication where identical content is usually provided by different peers. We suggest a system that combines both techniques using Proxy Affinity, Request Affinity and Replication Affinity considering user preferences, user behaviour, hardware resources and networks capabilities.

关键词： distributed multimedia quality of service (QoS) Content Delivery Networks (CDNs)

来源：评论

学校读者我要写书评

暂无评论

Controlling an ant colony optimization based search in distributed datasets

Controlling an ant colony optimization based search in distr...

引用

international conference on parallel and distributed computing and Networks

作者： Slivnik, Bostjan Jovanovic, Uros Univ Ljubljana Fac Comp & Informat Sci Trzaska 25 SI-1000 Ljubljana Slovenia XLAB Res SI-1000 Ljubljana Slovenia

ISBN: (纸本)9780889866379

An ant colony optimization method for searching in (possibly dynamic and/or unstructured) distributed datasets, as introduced by Jovanovic et. al [1], is considered. This paper provides two new results. Firstly, it describes how this method can easily be controlled by using different kinds of ants for aggregation of data found: "classic" pheromone aggregation ants should be used if network load caused by a distributed search should be strictly kept within given limits, while one-time aggregation ants should be used if the search process should react quickly due to changes in a dynamic distributed dataset. Secondly, it demonstrates that one-time aggregation ants are more effective than pheromone aggregation ants.

关键词： distributed search ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

A new robust centralized DMX algorithm

A new robust centralized DMX algorithm

引用

international conference on parallel and distributed computing and Networks

作者： Challenger, Moharram Khalilpour, Vahid Bayat, Peyman Meibodi, Mohammad Reza Islamic Azad University Shabestar Branch Iran Islamic Azad University Tafresh Branch Iran Amir-Kabir University Tehran Iran

ISBN: (纸本)9780889866379

In a distributed system, process synchronization is an important agenda. One of the major duties for process synchronization is mutual exclusion. This paper presents a new centralized fault tolerant distributed mutual exclusion algorithm based on Agrawala and El-Abbadi's algorithm. In new algorithm, once coordinator crashes, algorithm can recover lost data and return the coordinator in earlier situation. Thus fault tolerance will ascend and centralize algorithm's "single point of failure" will be omitted. So based algorithm will be more reliable. The only trade off is consuming some inappreciable time in case of coordinator's crash.

关键词： distributed system mutual exclusion fault tolerance centralized algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Probabilistic or deterministic QoS guarantees for flows scheduled with FP/DM

Probabilistic or deterministic QoS guarantees for flows sche...

引用

international conference on parallel and distributed computing and Networks

作者： Minet, Pascale Martin, Steven Saidane, Leila Azouz Masmoudi, Sahla INRIA Rocquencourt F-78153 Le Chesnay France Univ Paris 11 LRI F-91405 Orsay France ENSI Tunis 2010 Tunisia

ISBN: (纸本)9780889866379

In this paper, we consider flows requiring quantitative end-to-end QoS guarantees. We focus more particularly on the end-to-end response times of flows and their probability of meeting their end-to-end deadlines. We assume that packets are scheduled according to their fixed priority, reflecting the importance degree of the flow. If on a node two packets have the same fixed priority, the packet with the smallest relative deadline on the node considered is scheduled first. Therefore, this non-preemptive scheduling, called FP/DM, takes into account the deadline constraint. The deterministic approach, based on a worst case analysis, may lead to a bound on the flow end-to-end response times that can be reached infrequently. A network dimensioning based on this bound can be expensive in terms of resources. That is why we are interested in probabilistic QoS guarantees. We then evaluate the benefits brought by FP/DM with regard to FP/FIFO. With the deterministic approach, we compare the worst case response times and the laxities of the flows considered. With the probabilistic approach, we compare the probabilities of meeting the deadlines for the flows considered as well as the p-schedulabibility of the flow set.

关键词： scheduling queueing system QoS distributed real-time systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Explicit data organization SIMD instruction set architecture for media processors

Explicit data organization SIMD instruction set architecture...

引用

international conference on parallel and distributed computing and Networks

作者： Liu, Chunyue Qin, Xing Yan, Xiaolang Zhejiang Univ Inst VLSI Design Hangzhou 310027 Peoples R China

ISBN: (纸本)9780889866379

An Explicit Data Organization (EDO-SIMD) instruction set architecture (ISA) is proposed in this paper to reduce the data organization overhead of SIMD (Single Instruction Multiple Data) for media processors. It explicitly describes the data organization information in instruction words and merges the data organization with computation and store operation. An implementation of EDO-SIMD ISA based on a baseline SIMD processor is described and cycle accurate simulator for evaluation is designed. Simulation results show that, relative to the baseline SIMD architecture, EDO-SIMD ISA can achieve 1.34 to 1.40 speedups for the benchmark of real time H.264/AVC decoder and reduce 17.7% of the code size with only 0.49% increase in hardware area.

关键词： parallel processing EDO-SIMD ISA media processor

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 63 64 65 66 67 68 69 70 71 72 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：