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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

548 篇 会议
12 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

436 篇 工学
- 413 篇 计算机科学与技术...
- 274 篇 软件工程
- 109 篇 信息与通信工程
- 76 篇 电气工程
- 60 篇 控制科学与工程
- 24 篇 仪器科学与技术
- 20 篇 电子科学与技术（可...
- 10 篇 动力工程及工程热...
- 9 篇 机械工程
- 9 篇 生物医学工程（可授...
- 8 篇 交通运输工程
- 7 篇 生物工程
- 6 篇 土木工程
- 6 篇 安全科学与工程
- 5 篇 建筑学
- 5 篇 网络空间安全
- 4 篇 光学工程
- 3 篇 化学工程与技术
115 篇 理学
- 91 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 10 篇 物理学
- 9 篇 生物学
- 8 篇 化学
- 3 篇 地球物理学
74 篇 管理学
- 50 篇 管理科学与工程(可...
- 40 篇 工商管理
- 35 篇 图书情报与档案管...
7 篇 法学
- 5 篇 社会学
6 篇 经济学
- 6 篇 应用经济学
4 篇 医学
2 篇 农学

主题

42 篇 distributed comp...
32 篇 parallel process...
25 篇 parallel process...
22 篇 distributed comp...
17 篇 parallel algorit...
15 篇 computer archite...
14 篇 parallel computi...
14 篇 cloud computing
12 篇 distributed syst...
11 篇 concurrent compu...
10 篇 message passing
9 篇 fault tolerance
9 篇 data mining
9 篇 computational mo...
8 篇 java
8 篇 scheduling
7 篇 computer science
7 篇 load balancing
7 篇 parallel program...
7 篇 grid computing

机构

3 篇 high-performance...
3 篇 parallel and dis...
3 篇 shanghai jiao to...
3 篇 shanghai jiao to...
3 篇 parallel and dis...
3 篇 univ fed rio gra...
2 篇 high-performance...
2 篇 hpc laboratory c...
2 篇 department of co...
2 篇 washington univ ...
2 篇 institut univers...
2 篇 univ coll dublin...
2 篇 univ seville i3u...
2 篇 univ extremadura...
2 篇 guangxi univ sch...
2 篇 guangxi univ gua...
2 篇 school of comput...
2 篇 university of ch...
2 篇 ibm dublin techn...
2 篇 univ milan milan

作者

5 篇 kuan-ching li
5 篇 li kuan-ching
5 篇 chao-tung yang
5 篇 yang chao-tung
4 篇 gonzalez teofilo...
3 篇 kawamura takao
3 篇 navaux philippe ...
3 篇 kurt rothermel
3 篇 talia domenico
3 篇 zang binyu
3 篇 sugahara kazunor...
3 篇 zhang jilin
3 篇 ohkawa takeshi
3 篇 xia yubin
2 篇 cong guojing
2 篇 jiao han
2 篇 paraboschi stefa...
2 篇 brzezinski krzys...
2 篇 motomura shinich...
2 篇 park joon s.

语言

542 篇 英文
18 篇 其他
2 篇 俄文
2 篇 中文

检索条件"任意字段=19th IASTED International Conference on Parallel and Distributed Computing and Systems"

共 564 条记录，以下是261-270 订阅

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

详细简洁

排序：

Adaptive and Cost-Optimal parallel Algorithm for the 0-1 Knapsack Problem

Adaptive and Cost-Optimal Parallel Algorithm for the 0-1 Kna...

引用

19th international Euromicro conference on parallel, distributed and Network-Based Processing (PDP)

作者： Li, Kenli Li, Lingxiao Tesfazghi, Teklay Sha, Edwin Hsing-Mean Hunan Univ Coll Comp & Commun Changsha 410082 Hunan Peoples R China Univ Asmara Asmera Eritrea Univ Texas Dallas Dept Comp Sci Dallas TX USA

ISBN: (纸本)9780769543284

the 0-1 knapsack problem is well known to be NP-complete problem. In the past two decades, much effort has been done in order to find techniques that could lead to algorithms with a reasonable running time. this paper proposes a new parallel algorithm for the 0-1 knapsack problem where the optimal merging algorithm is adopted. Based on an EREW PRAM machine with shared memory, the proposed algorithm utilizes O((2(n/4))(1-epsilon)) processors, 0 <= epsilon <= 1, and O(2(n/2)) memory to find a solution for the n-element 0-1 knapsack problem in time O(2(n/4)(2(n/4))(epsilon)). thus the cost of the proposed parallel algorithm is O(2(n/2)), which is both the lowest upper-bound time and without memory conflicts if only quantity of objects is considered in the complexity analysis for the 0-1 knapsack problem. thus it is an improvement result over the past researches.

关键词： parallel computing combinatorial optimization 0-1 knapsack problem divide and conquer EREW PRAM

来源：评论

学校读者我要写书评

暂无评论

Dynamic I/O Reconfiguration for a NFS-based parallel File System

Dynamic I/O Reconfiguration for a NFS-based Parallel File Sy...

引用

19th international Euromicro conference on parallel, distributed and Network-Based Processing (PDP)

作者： Kassick, Rodrigo Boito, Francieli Zanon Navaux, Philippe O. A. Univ Fed Rio Grande do Sul Inst Informat Porto Alegre RS Brazil

ISBN: (纸本)9780769543284

the large gap between the speed in which data can be processed and the performance of I/O devices makes the shared storage infrastructure of a cluster a great bottleneck. parallel File systems try to smooth such difference by distributing data onto several servers, increasing the system's available bandwidth. However, most implementations use a fixed number of I/O servers, defined during the initialization of the system, and can not add new resources without a complete redistribution of the existing data. With the execution of different applications at the same time, the concurrent access to these resources can aggravate the existing bottleneck, making very hard to define an initial number of servers that satisfies the performance requirements of different applications. this paper presents a reconfiguration mechanism for the dNFSp file system that uses on-line monitoring of application's I/O behavior to detect performance contention and dedicate more I/O resources to applications with higher demands. these extra resources are taken from the available nodes of the cluster, using their I/O devices as a temporary storage. We show that this strategy is capable of increasing the I/O performance in up to 200% for access patterns with short I/O phases and 47% for longer I/O phases.

关键词： distributed File systems parallel I/O File systems IO Servers large clearance ON-LINE MONITORS scratch memory

来源：评论

学校读者我要写书评

暂无评论

Credibility Enhanced Reputation Mechanism for distributed e-Communities

Credibility Enhanced Reputation Mechanism for Distributed e-...

引用

19th international Euromicro conference on parallel, distributed and Network-Based Processing (PDP)

作者： Koutrouli, Eleni Tsalgatidou, Aphrodite Univ Athens Dept Informat & Telecommun Athens 15784 Greece

ISBN: (纸本)9780769543284

P2P communities are online communities of entities which offer services to each other without a central administration. Community members that need a specific service have to choose the transaction partner which they believe that will provide them with a required service of the expected quality;thus, they need mechanisms to support trust decisions regarding who they will transact with. P2P reputation systems provide trust mechanisms for P2P communities. Due to their decentralized and social nature, they are vulnerable to various types of attacks which distort their credibility and effectiveness. In our paper we first identify the credibility factors of a P2P reputation system. then we describe a dynamic reputation mechanism for P2P communities, which integrates some of these credibility factors and which can be used as part of a comprehensive reputation system enhancing its robustness against some types of attacks. Simulation results show the effectiveness of our mechanism in relation to other reputation mechanisms which do not integrate such factors.

关键词： component P2P reputation systems reputation attacks reputation metric e-community credibility P2P systems

来源：评论

学校读者我要写书评

暂无评论

Load Balancing for Data-parallel Applications on Network-on-Chip enabled Multi-Processor Platform

Load Balancing for Data-Parallel Applications on Network-on-...

引用

19th international Euromicro conference on parallel, distributed and Network-Based Processing (PDP)

作者： Yang, Jungsook Chun, Chuny Bagherzadeh, Nader Lee, Seung Eun Univ Calif Irvine Elect Engn & Comp Sci Irvine CA 92697 USA Seoul Natl Univ Technol Elect & Informat Engn Seoul South Korea

ISBN: (纸本)9780769543284

As the computation cost increases to meet the design requirements for computation-intensive applications on todays systems, the pressure to develop high performance parallel processors on a chip will increase. Network-on-Chip (NoC) techniques that interconnect multiple processing elements with routers are the solution for reducing computation time and power consumption by parallel processing on a chip. the shared communication platform is also essential to meet the scalability and complexity challenges for System-on-Chip (SoC). However not many parallel applications have been studied for such an architecture and workload characterizations have not been researched to benefit the architecture design optimization. In this paper, we study multiple data-parallel applications on a multicore NoC architecture with distributed memory space. We introduce an efficient runtime workload distribution algorithm that balances workloads of parallel processors and apply for selected embedded applications. Using our cycle accurate multicore simulator, we simulated our NoC-enabled multicore architecture model and executed data-parallel applications on various number of processing elements using the proposed runtime load balancing algorithm and analyzed performance and communication overheads.

关键词： load balancing network-on-chip parallel processing

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 9th iasted international conference on parallel and distributed computing and Networks, PDCN 2010

Proceedings of the 9th IASTED International Conference on Pa...

引用

9th iasted international conference on parallel and distributed computing and Networks, PDCN 2010

ISBN: (纸本)9780889868205

the proceedings contain 40 papers. the topics discussed include: a classified cluster based architecture for resource discovery in P2P networks using collaborative agents;the probabilistic double token ring;an efficient inter-domain routing in wireless mesh networks;a reliable transmission protocol for sensors in poorly connected areas over mobile networks;grid scheduling divisible load with load adaptive computing power;an energy efficient SMT processor with heterogeneous instruction set architectures;a proactive fault tolerance framework for high-performance computing;coverage overlay backfilling: efficient job allocation scheduling scheme for large-scale mesh-connected supercomputers;development of a network on chip for parallel processing systems;a low-power fault-tolerant NOC using error correction and detection codes;link state aware routing for multiple mobile robots in wireless sensor network;and channel assignment protocol with weaker restrictions in wireless multihop networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mapping distributed heterogeneous systems to a common language by applying ontologies

Mapping distributed heterogeneous systems to a common langua...

引用

作者： Vinek, Elisabeth Beran, Peter Paul Schikuta, Erich CERN CH-1211 Genève 23 Switzerland Workflow Systems and Technology Group University of Vienna Rathausstrasse 19/9 1010 Vienna Austria

ISBN: (纸本)9780889868649

the classification and selection of services within distributed, heterogeneous environments is a non trivial task. For a proper selection and composition of services in such environments - for example in a Grid or Cloud - it is required to dispose of detailed information about the existing resources and their characteristics. Particularly for applying appropriate optimization strategies these metadata are indispensable in order to decide which is the actual best resource for a given task, respectively query. It is thus a crucial task to first identify, classify and describe all system components and their attributes in a common language. therefore a generic, high-level model of a service ontology is proposed, that exposes the fundamental building blocks of a distributed, service-oriented environment, by providing a structured collection of components and their functional and non-functional attributes. Finally, the applicability of the proposed ontology is verified by applying it to two distinct application scenarios, one from the domain of distributed Database Management systems, and one from a High-Energy Physics experiment.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Adaptive parallel interval global optimization algorithms based on their performance for non-dedicated multicore architectures

Adaptive parallel interval global optimization algorithms ba...

引用

19th international Euromicro conference on parallel, distributed and Network-Based Processing (PDP)

作者： Sanjuan-Estrada, J. F. Casado, L. G. Garcia, I. Univ Almeria Dept Comp Architecture & Elect Almeria Spain Univ Malaga Dept Comp Architecture Malaga Spain

ISBN: (纸本)9780769543284

Branch and Bound (B&B) algorithms are highly parallelizable but they are irregular and dynamic load balancing techniques have been used to avoid idle processors. In previous work, authors use a dynamic number of threads at run time, which depends on the measured performance of the application for just one interval B&B algorithm running on the system. In this way, load balancing is achieved by thread generation decisions. In this work, we extend the study of these models to non-dedicated systems. In order to have a controlled testbed and comparable results, several instances of the interval global optimization algorithm are executed in the system, with the same model and problem to solve. therefore, a non-dedicated system is simulated because the execution of one application affects the execution of the other instances. this paper discusses different methods and models to decide when a thread should be created. Experiments show which of the proposed methods performs best in terms of maximum running time per application, using the fewest running threads. Following this parallel programming methodology, which is well suited for other B&B codes, applications can adapt their parallelism level to their performance and load of the system (at run time). this work represents a step forward towards increasing the performance of parallel algorithm running in non-dedicated and heterogeneous systems. the adaptive model discussed in this work is able to reduce the overall execution time for a set of instances of the same application running simultaneously. It also exempts the user from specifying the number of threads each application should use.

关键词： multi-threaded branch-and-bound global optimization non-dedicated multicore thread generation decisions sleeping threads kernel idle thread

来源：评论

学校读者我要写书评

暂无评论

Autonomic SLA-Aware Service Virtualization for distributed systems

Autonomic SLA-Aware Service Virtualization for Distributed S...

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： Attila Kertész Gábor Kecskeméti Ivona Brandic Computer and Automation Research Institute MTA SZTAKI Budapest Hungary Distributed Systems Group Vienna University of Technology Vienna Austria

Cloud computing builds on the latest achievements of diverse research areas, such as Grid computing, Service-oriented computing, business processes and virtualization. Managing such heterogeneous environments requires sophisticated interoperation of adaptive coordinating components. In this paper we introduce an SLA-aware Service Virtualization architecture that provides non-functional guarantees in the form of Service Level Agreements and consists of a three-layered infrastructure including agreement negotiation, service brokering and on demand deployment. In order to avoid costly SLA violations, flexible and adaptive SLA attainment strategies are used with a failure propagation approach. We demonstrate the advantages of our proposed solution with a biochemical case study in a Cloud simulation environment.

关键词： Computer architecture Virtual machining Computational modeling Manganese Variable speed drives Cloud computing Protocols

来源：评论

学校读者我要写书评

暂无评论

A Framework for Managing MapReduce Applications in Dynamic distributed Environments

A Framework for Managing MapReduce Applications in Dynamic D...

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： Fabrizio Marozzo Domenico Talia Paolo Trunfio DEIS University of Calabria Rende Cosenza Italy DEIS ICAR-CNR and University of Calabria Rende Cosenza Italy

MapReduce is a programming model widely used in data centers for processing large data sets in a highly parallel way. Current MapReduce systems are based on master-slave architectures that do not cope well with dynamic node participation, since they are mostly designed for conventional parallel computing platforms. On the contrary, in Internet-based computing environments, node churn and failures - including master failures - are likely to happen since nodes join and leave the network at an unpredictable rate. the goal of this work is enabling the use of MapReduce in dynamic distributed environments so as to combine the effectiveness of a well-established programming model with the scalability of a large-scale computing infrastructure. this paper presents an adaptive MapReduce framework, called P2P-MapReduce, which exploits a peer-to-peer model to manage intermittent node participation, master failures and job recovery in a decentralized but effective way, so as to provide a more robust MapReduce middleware that can be effectively exploited in Internet-scale dynamic distributed environments.

关键词： Peer to peer computing Computational modeling Computer architecture Indexes Programming Maintenance engineering Data models

来源：评论

学校读者我要写书评

暂无评论

A Failure Handling Framework for distributed Data Mining Services on the Grid

A Failure Handling Framework for Distributed Data Mining Ser...

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： Eugenio Cesario Domenico Talia ICAR-CNR Rende Italy University of Calabria Rende Italy

Fault tolerance is an important issue in Grid computing, where many and heterogenous machines are used. In this paper we present a flexible failure handling framework which extends a service-oriented architecture for distributed Data Mining previously proposed, addressing the requirements for fault tolerance in the Grid. the framework allows users to achieve failure recovery whenever a crash can occur on a Grid node involved in the computation. the implemented framework has been evaluated on a real Grid setting to assess its effectiveness and performance.

关键词： Computational modeling Data mining Fault tolerance Fault tolerant systems Algorithm design and analysis Data models Computer architecture

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 23 24 25 26 27 28 29 30 31 32 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：