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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

269 篇 会议
7 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

138 篇 工学
- 129 篇 计算机科学与技术...
- 75 篇 软件工程
- 37 篇 电气工程
- 9 篇 电子科学与技术（可...
- 9 篇 控制科学与工程
- 7 篇 信息与通信工程
- 6 篇 机械工程
- 2 篇 光学工程
- 2 篇 建筑学
- 2 篇 交通运输工程
- 2 篇 农业工程
- 2 篇 生物医学工程（可授...
- 2 篇 网络空间安全
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 纺织科学与工程
25 篇 理学
- 16 篇 数学
- 6 篇 物理学
- 5 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 生物学
24 篇 管理学
- 15 篇 管理科学与工程(可...
- 11 篇 图书情报与档案管...
- 8 篇 工商管理
3 篇 经济学
- 3 篇 应用经济学
3 篇 农学
- 3 篇 作物学
2 篇 法学
- 1 篇 法学
- 1 篇 社会学
1 篇 医学

主题

30 篇 peer to peer com...
26 篇 servers
21 篇 cloud computing
20 篇 parallel process...
19 篇 algorithm design...
19 篇 distributed comp...
18 篇 concurrent compu...
14 篇 computer archite...
13 篇 processor schedu...
13 篇 computational mo...
12 篇 bandwidth
12 篇 resource managem...
12 篇 protocols
12 篇 delay
11 篇 application soft...
11 篇 high performance...
10 篇 scalability
10 篇 routing
10 篇 streaming media
9 篇 hardware

机构

4 篇 institute of com...
3 篇 china univ geosc...
2 篇 institute of inf...
2 篇 pervasive techno...
2 篇 school of comput...
2 篇 karlsruhe inst t...
2 篇 department of co...
2 篇 brookhaven natl ...
2 篇 natl univ def te...
2 篇 university of st...
2 篇 department of en...
2 篇 indiana univ per...
2 篇 shenzhen institu...
2 篇 department of co...
2 篇 univ texas dept ...
2 篇 school of comput...
2 篇 software and ser...
2 篇 hyperspectral co...
2 篇 national laborat...
2 篇 graduate univers...

作者

3 篇 lizhe wang
3 篇 wang lizhe
2 篇 sens pierre
2 篇 feng wu-chun
2 篇 divitini monica
2 篇 sergio bernabe
2 篇 pinki pinki
2 篇 huang bormin
2 篇 li chen
2 篇 wang d
2 篇 nagalingam sv
2 篇 gianni francesco
2 篇 wang yijie
2 篇 tao jie
2 篇 ernst m.
2 篇 guihai chen
2 篇 ramón doallo
2 篇 rind o.
2 篇 ce-kuen shieh
2 篇 mora simone

语言

274 篇 英文
1 篇 其他
1 篇 中文

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

共 276 条记录，以下是151-160 订阅

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

详细简洁

排序：

A Static Task Scheduling Framework for Independent Tasks Accelerated Using a Shared Graphics Processing Unit

A Static Task Scheduling Framework for Independent Tasks Acc...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Teng Li Vikram K. Narayana Tarek El-Ghazawi NSF Center of High-Performance Reconfigurable Computing (CHREC) Department of Electrical and Computer Engineering The George Washington University Washington DC DC USA

the High Performance computing (HPC) field is witnessing the increasing use of Graphics Processing Units (GPUs) as application accelerators, due to their massively data-parallel computing architectures and exceptional floating-point computational capabilities. the performance advantage from GPU-based acceleration is primarily derived for GPU computational kernels that operate on large amount of data, consuming all of the available GPU resources. For applications that consist of several independent computational tasks that do not occupy the entire GPU, sequentially using the GPU one task at a time leads to performance inefficiencies. It is therefore important for the programmer to cluster small tasks together for sharing the GPU, however, the best performance cannot be achieved through an ad-hoc grouping and execution of these tasks. In this paper, we explore the problem of GPU tasks scheduling, to allow multiple tasks to efficiently share and be executed in parallel on the GPU. We analyze factors affecting multi-tasking parallelism and performance, followed by developing the multi-tasking execution model as a performance prediction approach. the model is validated by comparing with actual execution scenarios for GPU sharing. We then present the scheduling technique and algorithm based on the proposed model, followed by experimental verifications of the proposed approach using an NVIDIA Fermi GPU computing node. Our results demonstrate significant performance improvements using the proposed scheduling approach, compared with sequential execution of the tasks under the conventional multi-tasking execution scenario.

关键词： Graphics processing unit Kernel Processor scheduling Computational modeling Scheduling Measurement Computer architecture

来源：评论

学校读者我要写书评

暂无评论

RELookup: Providing Resilient and Efficient Lookup Service for P2P-VoD Streaming

RELookup: Providing Resilient and Efficient Lookup Service f...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Xu Zhang Zhenhua Li Tieying Zhang Liangpeng He Guihai Chen Nanjing University China Peking University Beijing China ICT Chinese Academy of Sciences Beijing China

For P2P-VoD streaming, an effective lookup algorithm for appropriate data suppliers is required to support the user's operation of random jump on the video. Existing lookup algorithms mainly adopt a centralized, flooding based, or DHT-based method. Facing the highly dynamic Internet environments, the centralized method incurs a single point of failure, the flooding-based method lacks scalability, and the DHT-based method is not resilient. Motivated by these problems, we propose a novel lookup algorithm, named "RELookup", which places peers on a resilient super node-based overlay and meanwhile utilizes the play point distance to efficiently locate candidate data suppliers. Besides, deliberate measures (i.e., special design of message format and node state) have been taken to reduce the coordination costs between super nodes to very little. Results of trace-driven simulations confirm the effectiveness of our proposed RELookup algorithm.

关键词： Peer to peer computing Indexes Servers Streaming media Algorithm design and analysis Accuracy Heart beat

来源：评论

学校读者我要写书评

暂无评论

Robust Fault-Tolerant Majority-Based Key-Value Store Supporting Multiple Consistency Levels

Robust Fault-Tolerant Majority-Based Key-Value Store Support...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Ahmad Al-Shishtawy Tareq Jamal Khan Vladimir Vlassov KTH Royal Institute of Technology Stockholm Sweden Swedish Institute of Computer Science Stockholm Sweden

the wide spread of Web 2.0 applications with rapidly growing amounts of user generated data, such as, wikis, social networks, and media sharing, have posed new challenges on the supporting infrastructure, in particular, on storage systems. In order to meet these challenges, Web 2.0 applications have to tradeoff between the high availability and the consistency of their data. Another important issue is the privacy of user generated data that might be caused by organizations that own and control data centers where user data are stored. We propose a large-scale, robust and fault-tolerant key-value object store that is based on a peer-to-peer network owned and controlled by a community of users. To meet the demands of Web 2.0 applications, the store supports an API consisting of different read and write operations with various data consistency guarantees from which a wide range of web applications would be able to choose the operations according to their data consistency, performance and availability requirements. For evaluation, simulation has been carried out to test the system availability, scalability and fault-tolerance in a dynamic, Internet wide environment.

关键词： Peer to peer computing Availability Data models distributed databases Generators Scalability Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

A Semantic Decentralized Chord-Based Resource Discovery Model for Grid computing

A Semantic Decentralized Chord-Based Resource Discovery Mode...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Abdul Khalique Shaikh Saadat M. Alhashmi Rajendran Parthiban School of IT Monash University Bandar Sunway Malaysia School of Engineering Monash University Bandar Sunway Malaysia

Grid computing aggregates distributed computing resources to execute computationally complex jobs. the selection of resources in a Grid system involves finding and locating resources based on users' requirements. Identifying an appropriate resource selection mechanism for Grid jobs is a major concern because a suitable mechanism helps to schedule and allocate resources better. the resource discovery techniques proposed over the years can be categorized into three major types-centralized, hierarchical and decentralized. the performance of each type can be measured in terms of scalability, load balancing and fault tolerance. the resource discovery based on centralized and hierarchical techniques is recommended for small and medium size Grids. Due to limitations such as poor scalability and single point of failure in centralized and hierarchical approaches, a decentralized resource discovery is usually preferred for large size Grids. Lack of coordination between users and providers in a highly decentralized heterogeneous Grid environment often results in user jobs failing in finding relevant resources. One of the reasons for rejection of jobs is the usage of fixed schema between users request and providers availability which causes high possibility of missing relevant resources. We present a semantic decentralized resource discovery model by using P2P Chord protocol to improve job success probability and to enhance utilization of resources. Preliminary simulations carried out using GridSim and PlanetSim simulators show improved success probability for complex jobs and also show promising results with enhanced utilization of resources.

关键词： Semantics Ontologies Peer to peer computing Protocols Computational modeling Scalability Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Gossip-Based Cooperative Caching for Mobile Phone Games in IMANETs

Gossip-Based Cooperative Caching for Mobile Phone Games in I...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Xiaopeng Fan Jiannong Cao Yunhuai Liu Yaobin He Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong China

Cooperative caching is an efficient way to improve the performance of data access in mobile wireless networks, by cache nodes cooperatively caching copies of data items in their limited storage. With more demands on sharing a video or other data, especially for mobile phone games in an Internet-based Mobile Ad Hoc Network, the relations among data items become much more important than before. However, most of the existing works do not consider inherent relations among these data items. In this paper, we present a novel solution, Gossip-based Cooperative Caching (GosCC), to address the cache placement problem, considering the sequential relation among data items. Each mobile node stores the IDs of data items cached locally and the ID of the data item in use into its progress report. Each mobile node also makes use of these progress reports to determine whether a data item should be cached locally. these progress reports are propagated within the network in a gossip-based way. To improve user experience, GosCC aims to provide users with an uninterrupted data access service. Simulation results show that GosCC achieves better performance than the best one of the existing solutions, Benefit-based Data Caching, in terms of average interruption intervals and average interruption times, while sacrificing message cost to a certain degree.

关键词： Mobile communication Peer to peer computing Cooperative caching Reliability Games Mobile computing Mobile handsets

来源：评论

学校读者我要写书评

暂无评论

Using P2P Networks to Repair Packet Losses in Digital Video Broadcasting systems

Using P2P Networks to Repair Packet Losses in Digital Video ...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Yung-Tsung Weng Ce-Kuen Shieh Tzu-Chi Huang Yu-Ben Miao Department of Management Information System Far East University Tainan Taiwan Institute of Computer and Communication Engineering Department of Electrical Engineering National Cheng Kung University Tainan Taiwan Department of Electric Engineering Lunghwa University of Science and Technology Taoyuan Taiwan Information and Communications Research Laboratories Industrial Technology Research Institute Hsinchu Taiwan

Digital multimedia broadcasting services require resiliency against signal fading due to signal encounters with bad weather, terrain obstructions, such as tree, building, etc. there are several solutions that use peer-to-peer network to repair packet losses. But they have some shortcomings such as long lookup latency, control message overhead, flash crowd problem and low chunk availability. In this paper we propose a novel solution that considers load distribution in structured peer-to-peer networks and repairing packet losses in short lookup latency. Our proposed solution doesn't need to modify the codec technology for multimedia stream. Our proposed solution can achieve load evenly distributed, high chunk availability, short lookup latency and low control message overhead by using peer-to-peer network to repair packet losses in digital multimedia broadcasting systems.

关键词： Peer to peer computing Digital video broadcasting Media Message systems Streaming media Receivers Multimedia communication

来源：评论

学校读者我要写书评

暂无评论

Reflex Barrier: A Scalable Network-Based Synchronization Barrier

Reflex Barrier: A Scalable Network-Based Synchronization Bar...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Ahmad Anbar Olivier Serres Tarek El-Ghazawi NSF Center of High-Performance Reconfigurable Computing (CHREC) Department of Electrical and Computer Engineering The George Washington University USA

High-performance computing is witnessing the proliferation of multi-core processors in parallel architectures, and the trend is expected to increase further with the emerging many-core technology, leading to hundreds of processing cores within each compute node in the near future. Along side with this trend, it is also clear that total number of cores within the whole system is increasing. To be able to harvest the fruits of this massive parallelism, inter-process synchronization and communication should be as lightweight as they can be, and should be relying on as limited involvement as possible of the participating processors/cores. the synchronization algorithms that target shared memory processors are expected not to be able to scale on many-cores as they rely on atomics, locks, and/or cache coherence protocols, which all should be very costly operations on many-cores. In the same time, some many core architectures provide user space networks on chip (NoCs) that operate similar to regular networks. In this paper, we are introducing the Reflex barrier, a new synchronization barrier algorithm that relies on fundamental networking concepts. As the barrier relies on the characteristics of the network, it requires very little intervention from the participating processors/cores. the algorithm can also be implemented as split phase, which furnish an opportunity to reduce the synchronization cost. We implemented the algorithm using Unified parallel C (UPC), MPI and pthreads. We tested our implementation on TILE64, a 64-core processor. the performance of the Reflex barrier is also analyzed and compared to other algorithms using performance models.

关键词： Program processors Synchronization Message systems Tiles Coherence Computer architecture Routing

来源：评论

学校读者我要写书评

暂无评论

Heterogeneity-Aware Peak Power Management for Accelerator-Based systems

Heterogeneity-Aware Peak Power Management for Accelerator-Ba...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Guibin Wang Yisong Lin National Laboratory for Parallel and Distributed Processing National University of Defense Technology China

Power management has become one of the first-order considerations in high performance computing field. Many recent studies focus on optimizing the performance of a computer system within a given power budget. However, most existing solutions adopt fixed period control mechanism and are transparent to the running applications. Although the application-transparent control mechanism has relatively good portability, it exhibits low efficiency in accelerator-based heterogeneous parallel systems. In typical accelerator-based parallel systems, different processing units have largely different processing speeds and power consumption. Under a given power constraint, how to choose the processor to be slowed down and how to schedule a parallel task onto different processors for the maximum performance are different from those in homogeneous systems and have not been well studied. From the motivating example in this paper, we could find that in order to efficiently harness the heterogeneous parallel processing, one should not only perform dynamic voltage/frequency scaling (DVFS) to meet the power budget, but also tune the parallel task scheduling to adapt to the changes. In this paper, we propose a heterogeneity-aware peak power management, which extends existing application-transparent power controller with an application-aware power controller. Firstly, we theoretically analyze the conditions for the maximum performance given a power budget for heterogeneous systems. Based on this result, we provide a power-constrained parallel task partition algorithm, which coordinates parallel task partition and voltage scaling for heterogeneous processing units to achieve the optimal performance given a system power budget. Finally, we evaluate the proposed method on a typical CPU-GPU heterogeneous system, and validate the superiority of application-aware power controller over the existing method.

关键词： Graphics processing unit Power demand Partitioning algorithms Schedules Kernel Monitoring Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

the Low-Cost Secure Sessions of Access Control Model for distributed Applications by Public Personal Smart Cards

The Low-Cost Secure Sessions of Access Control Model for Dis...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Kuo-Yi Chen Chin-Yang Lin Ting-Wei Hou Institute of Information Science Academia Sinica Taipei Taiwan Department of Engineering Science National Cheng Kung University Tainan Taiwan

the secure requirement of modern information systems is increasing significantly nowadays, especially in cloud computing with distributed applications. Among secure mechanisms of an organization, the access control (AC) is a foundation for modern information systems. In order to reach an effective and flexible approach of access control, the Role-based Access Control (RBAC) models are widely deployed in organizations. Comparing with traditional discretionary access control (DAC) and mandatory access control (MAC), the user-role-subject mapping of a RBAC model provides effective permissions assignments for access control of an organization. However, the RBAC sessions could be stretched over multiple distributed servers in cloud computing. the traversed sessions between servers could be modified, monitored and attacked by modern hacker techniques, and become secure leaks in RBAC models. In order to ensure secure sessions in cloud computing, various encryption approaches are used. Among these encryption approaches, the use of digital certificates by asymmetric encryption methods could be an appropriate solution to ensure the security of RBAC sessions. However, the cost of public/private keys management and issuing an appropriate certificate tokens for each member in organizations could be very expensive. the high cost might block the deployment of secure RBAC sessions, and then reduce the secure level of organizations. In order to improve this issue, a low-cost approach of secure sessions for RBAC models is proposed in this paper. the personal smart cards can be used as a certificate tokens in RBAC models to reach effective user authentications. Moreover, each session of RBAC models, including user-role-subject assignments and content-based accesses, can be protected by digital certificates which is generated by user own smart cards. thus the security of RBAC sessions can be improved significantly. It is worth noting that personal smart cards are issued by public depar

关键词： Access control Smart cards Authentication Encryption Organizations Servers

来源：评论

学校读者我要写书评

暂无评论

Optimal P2P Cache Sizing: A Monetary Cost Perspective on Capacity Design of Caches to Reduce P2P Traffic

Optimal P2P Cache Sizing: A Monetary Cost Perspective on Cap...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Haibin Zhai Albert K. Wong Hai Jiang Yi Sun Jun Li Graduate University of Chinese Academy of Sciences Beijing China Institute of Computing Technology Chinese Academy of Sciences Beijing China Hong Kong University of Science and Technology Hong Kong China

Peer-to-Peer (P2P) systems are generating a large portion of the total Internet traffic and imposing a heavy burden on Internet Services Providers (ISPs). Proxy caching for P2P traffic is an effective means of reducing network usage, thereby reducing operation costs for ISPs. Proxy cache storage design has a significant impact on ISPs. While there are several works on how to optimally design cache locations and capacity allocation to each location given a total capacity, few works tell ISPs what is the optimal total P2P cache storage capacity. In this paper, we propose an analysis method to the problem of optimally determining P2P cache size. An analysis methodology is proposed to determine the optimal cache size by considering the monetary costs of cache storage and bandwidth. Guided by our model, a close-form expression is developed to guide an ISP in the cache capacity design. Numerical evaluation results show that ISPs can achieve significant cost saving by deploying P2P cache and by allocating the cache capacity optimally.

关键词： Bandwidth Cache storage Arrays Mathematical model Equations Storage area networks Peer to peer computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共28页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：