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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,699 篇 会议
48 册 图书
25 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,366 篇 工学
- 1,236 篇 计算机科学与技术...
- 550 篇 软件工程
- 241 篇 信息与通信工程
- 219 篇 电气工程
- 74 篇 控制科学与工程
- 50 篇 电子科学与技术（可...
- 43 篇 生物工程
- 34 篇 机械工程
- 26 篇 动力工程及工程热...
- 22 篇 仪器科学与技术
- 21 篇 力学（可授工学、理...
- 20 篇 建筑学
- 19 篇 土木工程
- 18 篇 生物医学工程（可授...
- 15 篇 材料科学与工程（可...
- 15 篇 安全科学与工程
- 14 篇 化学工程与技术
- 13 篇 石油与天然气工程
329 篇 理学
- 227 篇 数学
- 55 篇 物理学
- 51 篇 生物学
- 29 篇 系统科学
- 28 篇 统计学（可授理学、...
- 20 篇 化学
213 篇 管理学
- 157 篇 管理科学与工程(可...
- 66 篇 图书情报与档案管...
- 49 篇 工商管理
71 篇 医学
- 62 篇 临床医学
15 篇 法学
- 13 篇 社会学
14 篇 经济学
- 14 篇 应用经济学
9 篇 文学
8 篇 教育学
6 篇 农学
1 篇 军事学

主题

109 篇 distributed comp...
79 篇 parallel process...
76 篇 distributed comp...
62 篇 cloud computing
51 篇 parallel computi...
44 篇 computational mo...
41 篇 parallel program...
39 篇 computer archite...
35 篇 distributed data...
34 篇 fault tolerance
29 篇 concurrent compu...
29 篇 middleware
28 篇 parallel algorit...
28 篇 mapreduce
28 篇 parallel process...
26 篇 resource managem...
25 篇 application soft...
25 篇 big data
24 篇 wireless sensor ...
24 篇 protocols

机构

14 篇 saint petersburg...
7 篇 chinese acad sci...
6 篇 univ adelaide sc...
6 篇 institute of com...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
5 篇 plekhanov russia...
4 篇 saint petersburg...
4 篇 harbin inst tech...
4 篇 meshcheryakov la...
4 篇 centre for distr...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 st petersburg st...
4 篇 science and tech...
3 篇 huazhong univ sc...
3 篇 joint institute ...
3 篇 king saud univer...
3 篇 department of co...
3 篇 university of el...

作者

17 篇 zomaya albert y.
11 篇 shen hong
10 篇 bogdanov alexand...
9 篇 korkhov vladimir
8 篇 degtyarev alexan...
8 篇 albert y. zomaya
6 篇 li y
6 篇 taheri javid
5 篇 dustdar schahram
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 kutovskiy nikola...
5 篇 nakayama shigeru
5 篇 huang z.
5 篇 sousa leonel
5 篇 gankevich ivan
5 篇 rothermel kurt
4 篇 jerzy waśniewski
4 篇 leung k.

语言

1,731 篇 英文
18 篇 中文
15 篇 其他
9 篇 俄文

检索条件"任意字段=9th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1772 条记录，以下是1601-1610 订阅

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

详细简洁

排序：

A High Performance 3-D parallel Filtering Algorithm using the Vector Radix Fast Hartley Transform

A High Performance 3-D Parallel Filtering Algorithm using th...

引用

Proceedings of the Fourth international conference on parallel and Distribyted computing,applications and technologies(第四届并行与分布式计算应用与技术国际会议)

作者： M.Aziz S.Boussakta D.C.McLernon The Institute of Integrated Information Systems School of Electronic and Electrical Engineering University of Leeds Leeds LS2 9JT UK

In this paper we present an efficient method for 3-D parallel digital filtering using a new parallel filtering algorithm based on the 3-D vector radix fast Hartley transform (3-D VR FH). this method is suitable for high resolution/high speed image/video processing. the 3-D parallel algorithm is highly parallel and efficient as it overcomes the overhead and performance limitations of the block filtering method by eliminating the overlapping segments and boundary conditions in parallel filtering applications. It also lifts the restrictions on the input size for high performance in the block-filtering algorithm, as both the 3-D input data and impulse response of the system are segmented into smaller subsections. these subsections are independent and can be simultaneously processed. the algorithm's structure and mathematical derivation are given and the performance of the algorithm is tested and presented using a parallel processing system with 4-DSP processors.

关键词： 3-D filtering algorithm parallel processing multiprocessor system

来源：评论

学校读者我要写书评

暂无评论

Equipartitioning versus Marginal Analysis for parallel Job Scheduling

Equipartitioning versus Marginal Analysis for Parallel Job S...

引用

Proceedings of the Fourth international conference on parallel and Distribyted computing,applications and technologies(第四届并行与分布式计算应用与技术国际会议)

作者： Brian G Patrick Michael Jack Computer Science/Studies Trent University Peterborough Ontario CANADA K9J 7B8

Given n malleable and non-preemptable parallel jobs that arrive for execution at time 0, we examine and compare two job scheduling strategies that allocate m identical processors among the n competing jobs. In all cases, n＜m. the first strategy is based on the heuristic paradigm of equipartitioning, and the second is based on the notion of marginal analysis. Equipartitioning uses no a priori information when processor allocations are made to parallel jobs. Marginal analysis, on the other hand, assumes full a priori information in order to maximize processor utility. In this paper, we compare both strategies with respect to average time-to-completion (system performance) and overall time-to-completion (system efficiency). Using a simple job model characterized by sequential time-tocompletion and degree of parallelism, it is demonstrated via simulation that in most cases, the uninformed strategy of equipartitioning outperforms marginal analysis with respect to system performance and without a commensurate degradation in system efficiency.

关键词： Job scheduling parallel computation performance evaluation simulation

来源：评论

学校读者我要写书评

暂无评论

A graph transformational approach to the multiprocessor scheduling of iterative computations

A graph transformational approach to the multiprocessor sche...

引用

Proceedings of the Fourth international conference on parallel and Distribyted computing,applications and technologies(第四届并行与分布式计算应用与技术国际会议)

作者： Frode Eika Sandnes Oliver Sinnen Dept.Computer Science Faculty of Engineering Oslo University College Cort Adelers gate 30 N-0276 O INESC-ID Rua Alves Redol 9-2 Sala 236 1000-029 Lisboa Portugal

A modular strategy for scheduling iterative computations is proposed. An iterative computation is represented using a cyclic task-graph. the cyclic task-graph is transformed into an acyclic task-graph. this acyclic task-graph is subsequently scheduled using one of the many well-known and high-quality static scheduling strategies from the literature. Graph unfolding is not employed and the generated schedules therefore require less memory than schedules generated through graph unfolding. Further, the number of iterations does not need to be known at compile-time. the effectiveness of the approach is compared to other methods including a graph unfolding strategy. In addition, the paper experimentally quantifies how the task transformation affects the make-span of the schedules.

关键词： multiprocessor scheduling iterative computation task-graphs genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Composing specifications of event based applications

引用

6th international conference on Fundamental Approaches to Software Engineering, FASE 2003 Held as Part of the Joint European conferences on theory and Practice of Software, ETAPS 2003

作者： Fenkam, Pascal Gall, Harald Jazayeri, Mehdi Technical University of Vienna Distributed Systems Group Argentinierstrasse 8/184-1 ViennaA-1040 Austria

ISBN: (纸本)3540008993

the event based architectural style has been recognized as fostering the development of large-scale and complex systems by loosely coupling their components. It is therefore increasingly deployed in various environments such as middleware for mobile computing, message oriented middleware, integration frameworks, communication standards, and commercial toolkits. the development of applications based on this paradigm is, however, performed in such an ad-hoc manner that it is often difficult to reason about their correctness. this is partly due to the lack of suitable specification and verification techniques. In this paper, we review the existing theory of specifying and verifying such applications, argue that it cannot be applied for the development of large-scale and complex systems, and finally propose a novel approach (LECAP) for the construction of correct event based applications. Our approach is superior to the existing approaches in many respects: 1) we assume a while-parallel language with a synchronization construct, 2) neither a pending event infrastructure nor a consume statement are required, 3) a dynamic (instead of static) binding is assumed, 4) no restriction is made on the number of simultaneous executions of the same program 5) our approach is oriented towards top-down development of systems. the paper also presents two examples for illustrating the approach. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Revisiting join site selection in distributed database systems

Revisiting join site selection in distributed database syste...

引用

9th international Euro-Par conference on parallel Processing, Euro-Par 2003

作者： Ye, Haiwei Kerhervé, Brigitte Bochmann, Gregor V. Département d’ IRO Université de Montréal CP 6128 succ Centre-Ville MontréalQCH3C 3J7 Canada Département d'informatique Université du Québec à Montréal CP 8888 succ Centre-ville MontréalQCH3C 3P8 Canada School of Information Technology and Engineering University of Ottawa P.O. Box 450 Stn A OttawaONK1N 6N5 Canada

ISBN: (纸本)354040788X

New characteristics for e-commerce applications, such as highly distributed data and unpredictable system nature, require us to revisit query processing for distributed database systems. As join operations involve relations over multiple sites, the site to carry out the join operation can have a significant impact on the performance. In this paper, we propose a new join site selection method. Our method is different from traditional methods in the following ways. First, the candidate sites are not restricted to the operand sites or query site as adopted by most database systems. Second, it considers dynamic system properties such as available bandwidth and system loads. We also conducted some experiments to offer a comparison between our method and the traditional one. the results show the advantage of our method under various system statuses. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of a High-Performance Interconnection Network:th-Net

Design and Implementation of a High-Performance Interconnect...

引用

the Fourth international conference on parallel and distributed computing, applications and technologies

作者： Zhaoyang Li Yi Zhang Yu Chen Ruichun Tang Department of Computer Science and Technology Tsinghua University

this paper provides a high performance interconnection network that can provide high bandwidth and low latency communication on a custom gigabit crossbar *** implementation consists of the high-speed switch th-Switch,the VIA-supported NIC th-NIC and protocol software th-VIA complied with VIA. th-Switch uses circuit-switching technique instead of packet-switching to reduce the communication *** design and implementation of th-Net's communication mechanism is based on the VIA specification that the data transferring can be performed directly at the user application level,bypassing the operating system kernel,to reduce the communication *** design and implementation details are discussed in this paper.

关键词： High-speed Interconnection VIA Cluster User-level Networking(ULN) High-performance computing

来源：评论

学校读者我要写书评

暂无评论

Equipartitioning versus Marginal Analysis for parallel Job Scheduling

Equipartitioning versus Marginal Analysis for Parallel Job S...

引用

the Fourth international conference on parallel and distributed computing, applications and technologies

作者： Brian G.Patrick Michael Jack Computer Science/Studies Trent University PeterboroughOntarioCANADA K9J 7B8

Given n malleable and non-preemptable parallel jobs that arrive for execution at time 0,we examine and compare two job scheduling strategies that allocate m identical processors among the n competing *** all cases,n≤*** first strategy is based on the heuristic paradigm of equipartitioning,and the second is based on the notion of marginal *** uses no a priori information when processor allocations are made to parallel *** analysis,on the other hand,assumes full a priori information in order to maximize processor *** this paper,we compare both strategies with respect to average time-to-completion(system performance) and overall time-to-completion(system efficiency).Using a simple job model characterized by sequential time-to-completion and degree of parallelism,it is demonstrated via simulation that in most cases,the uninformed strategy of equipartitioning outperforms marginal analysis with respect to system performance and without a commensurate degradation in system efficiency.

关键词： Job scheduling parallel computation performance evaluation simulation

来源：评论

学校读者我要写书评

暂无评论

A High Performance 3-D parallel Filtering Algorithm using the Vector Radix Fast Hartley Transform

A High Performance 3-D Parallel Filtering Algorithm using th...

引用

the Fourth international conference on parallel and distributed computing, applications and technologies

作者： M.Aziz S.Boussakta D.C.McLernon The Institute of Integrated Information Systems School of Electronic and Electrical Engineering University of Leeds LeedsLS2 9JTUK

In this paper we present an efficient method for 3-D parallel digital filtering using a new parallel filtering algorithm based on the 3-D vector radix fast Hartley transform(3-D VR FHT).this method is suitable for high resolution/high speed image/video *** 3-D parallel algorithm is highly parallel and efficient as it overcomes the overhead and performance limitations of the block filtering method by eliminating the overlapping segments and boundary conditions in parallel filtering *** also lifts the restrictions on the input size for high performance in the block-filtering algorithm,as both the 3-D input data and impulse response of the system are segmented into smaller *** subsections are independent and can be simultaneously *** algorithm's structure and mathematical derivation are given and the performance of the algorithm is tested and presented using a parallel processing system with 4-DSP processors.

关键词： 3-D filtering algorithm parallel processing multiprocessor system

来源：评论

学校读者我要写书评

暂无评论

A graph transformational approach to the multiprocessor scheduling of iterative computations

A graph transformational approach to the multiprocessor sche...

引用

the Fourth international conference on parallel and distributed computing, applications and technologies

作者： Frode Eika Sandnes Oliver Sinnen Dept.Computer Science Faculty of Engineering Oslo University College Cort Adelers gate 30N-0276 OsloNorway INESC-ID Rua Alves Redol 9-2 Sala 236 1000-029 LisboaPortugal

A modular strategy for scheduling iterative computations is *** iterative computation is represented using a cyclic *** cyclic task-graph is transformed into an acyclic *** acyclic task-graph is subsequently scheduled using one of the many well-known and high-quality static scheduling strategies from the *** unfolding is not employed and the generated schedules therefore require less memory than schedules generated through graph ***,the number of iterations does not need to be known at *** effectiveness of the approach is compared to other methods including a graph unfolding *** addition,the paper experimentally quantifies how the task transformation affects the make-span of the schedules.

关键词： multiprocessor scheduling iterative computation task-graphs genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

UCAN: a unified cellular and ad-hoc network architecture 03

UCAN: a unified cellular and ad-hoc network architecture

引用

Proceedings of the 9th annual international conference on Mobile computing and networking

作者： Haiyun Luo Ramachandran Ramjee Prasun Sinha Li (Erran) Li Songwu Lu University of California Los Angeles CA Lucent Technologies Holmdel NJ Ohio State University Columbus OH

ISBN: (纸本)9781581137538

In third-generation (3G) wireless data networks, mobile users experiencing poor channel quality usually have low data-rate connections with the base-station. Providing service to low data-rate users is required for maintaining fairness, but at the cost of reducing the cell's aggregate throughput. In this paper, we propose the Unified Cellular and Ad-Hoc Network (UCAN) architecture for enhancing cell throughput, while maintaining fairness. In UCAN, a mobile client has both 3G cellular link and IEEE 802.11-based peer-to-peer links. the 3G base station forwards packets for destination clients with poor channel quality to proxy clients with better channel quality. the proxy clients then use an ad-hoc network composed of other mobile clients and IEEE 802.11 wireless links to forward the packets to the appropriate destinations, thereby improving cell throughput. We refine the 3G base station scheduling algorithm so that the throughput gains of active clients are distributed proportional to their average channel rate, thereby maintaining fairness. With the UCAN architecture in place, we propose novel greedy and on-demand protocols for proxy discovery and ad-hoc routing that explicitly leverage the existence of the 3G infrastructure to reduce complexity and improve reliability. We further propose a secure crediting mechanism to motivate users to participate in relaying packets for others. through extensive simulations with HDR and IEEE 802.11b, we show that the UCAN architecture can improve individual user's throughput by up to 310% and the aggregate throughput of the HDR downlink by up to 60%.

关键词： unified architecture mobile ad-hoc networks 3G wireless networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共178页 << < 157 158 159 160 161 162 163 164 165 166 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：