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

2nd ieee international conference on parallel, distributed and grid computing (pdgc)

作者： ndiaye, ndeye Massata Sens, Pierre Thiare, Ousmane Gaston Berger Univ Dept Comp Sci BP 234 St Louis Senegal

ISBN: (纸本)9781467329255;9781467329224

grid computing mutualizes more computing resources working in a calculation or a common task. The increase in the number of components in the system leads also increases the number of fault. These failures result in a loss of several cycles of running applications. It is therefore essential to be able to tolerate faults so that the computation can continue to execute and finish despite failures, all while maintaining maximum performance. One advantage of coordinated checkpoint is its capacity to have a very low overhead as long as the execution stays fault free. On the contrary, due to the fact that uncoordinated checkpoint requires being complemented by a message log protocol, this adds a significant penalty for all message transfers, even in case of fault-free execution. With message log, these problems do not arise simply because it processes checkpoint and restart autonomously. These differences suggest that the best approach depend on the fault frequency. In this paper, we propose a hierarchical composition of algorithms: Chandy-Lamport protocol and pessimistic message logging protocol. We have implemented and compared the performance of these protocols in grid computing using the Omnet++ simulator [3].

关键词： grid computing coordinated checkpointing chandy-lamport pessimistic message logging

来源：评论

学校读者我要写书评

暂无评论

Resource Pricing Strategy in Wireless grid Using Non-cooperative Bargaining Game

Resource Pricing Strategy in Wireless Grid Using Non-coopera...

引用

2nd ieee international conference on parallel, distributed and grid computing (pdgc)

作者： Birje, Mahantesh N. Manvi, Sunilkumar S. Das, Sajal K. Basaveshwar Engn Coll Dept ISE Bagalkot 587102 India REVA ITM Dept ECE Bangalore 560064 Karnataka India Univ Texas Arlington TX 76019 USA

ISBN: (纸本)9781467329255;9781467329224

The consumers in a wireless grid will prefer reliable and cost optimal resources for job execution, while the grid service providers prefer efficient utilization of their resources. Hence brokering of resources that meet the requirements of consumers and providers is a challenging task in presence of unstable (wireless) network connections, market dynamics and rational users. This paper models a resource pricing strategy using a non-cooperative bargaining game for resource allocation considering dynamics in the grid market. The proposed scheme is simulated to evaluate the performance parameters like offered price, surplus, negotiation time and job completion time. We observed that our scheme performs better than existing scheme in terms of negotiation time and job completion time.

关键词： Wireless grid resource allocation game theory non-cooperative bargaining game

来源：评论

学校读者我要写书评

暂无评论

Interoperability of WiFi and WiMAX

Interoperability of WiFi and WiMAX

引用

2nd ieee international conference on parallel, distributed and grid computing (pdgc)

作者： Dutta, Nitul Biradar, Sangappa Ramachandra Sikkim Manipal Inst Technol Majitar 737136 Sikkim India Mody Inst Technol & Sci Lakshmangarh 332311 Rajasthan India

ISBN: (纸本)9781467329255;9781467329224

The aim of this paper is to explore the two most popular wireless networks ieee 802.11 and ieee 802.16 with a view to examine the challenges and issues involved in the integration of both the networks. The 802.11 or Wireless Fidelity (WiFi) is a low cost wireless access technology that supports low data rate within a short range. On the contrary, the ieee 802.16 or WiMAX (Worldwide Interoperability for Microwave Access or) is a costly network that support a data rate of 70Mbps within the range of 50km. To provide guaranteed and satisfactory service quality with moderate cost in wireless environment, integration of the two network technology is necessary. The difference in the MAC layer protocol and routing mechanism the interoperability of the two networks are challenging. In this paper, a brief discussion on WiFi and WiMAX issues are carried out, and investigated various methods and challenges for interoperation of WiFi and WiMAX technology.

关键词： ieee 802.11 ieee 802.16 WiFi WiMAX

来源：评论

学校读者我要写书评

暂无评论

Adaptive Execution and Performance Tuning of parallel Jobs in Computational Desktop grid Using gridGain

Adaptive Execution and Performance Tuning of Parallel Jobs i...

引用

2nd ieee international conference on parallel, distributed and grid computing (pdgc)

作者： Reddy, Hemant Kumar Patra, Manas Roy, Diptendu Sinha Department of CSE National Institute of Science & Technology India

ISBN: (纸本)9781467329255

Desktop grids, which use the idle cycles of desktop pes of small enterprises and institutions, usually are equipped with hundreds or thousands of desktops, mainly used for office tasks. Such grids vary markedly from conventional grids (multi-site clusters) in terms of their dynamic nature. This calls for the need of new scheduling algorithms, tailor-made for such systems. Since the nature of such desktop grids attract highly parallel algorithms, designing efficient scheduling algorithms of parallel jobs on desktop grids become worthwhile research issue. In this paper an adaptive scheduling mechanism for desktop grids has been presented, where tasks are initially assigned to different available grid resources based on a resource selection algorithm. The resource selection algorithm, which works in an online mode, selects resources based on given set of parameters and previous execution log in an adaptive (flexible) manner. Execution log helps to decide in choosing the most relevant computational parameter depending upon the tasks that are assigned to grid resources. Later, during task execution, if performance of any task degrades, then adaptive algorithm assists the scheduling policy to adapt the system to achieve the high throughput by rescheduling to either the server node or to the best available local node at present. This method can also deal with the unpredictable execution conditions commonly encountered on desktop grids. In this paper, gridGain 2.0 has been used for setting up desktop grid test bed and the performance of the aforesaid adaptive scheduling algorithm has been presented.

关键词： adaptive execution desktop grid grid gain rescheudling performance tuning

来源：评论

学校读者我要写书评

暂无评论

Comparative Performance Analysis of Routing Protocols in Mobile Ad Hoc Networks under JellyFish Attack

Comparative Performance Analysis of Routing Protocols in Mob...

引用

2nd ieee international conference on parallel, distributed and grid computing (pdgc)

作者： Wazid, Mohammad Kumar, Vipin Goudar, R. H. Graph Era Univ Dept CSE Dehra Dun Uttar Pradesh India

ISBN: (纸本)9781467329255;9781467329224

A mobile ad hoc network is much more assailable to attacks than a wired network due to its limited physical security, high mobility and lack of centralized administration. Jellyfish is a new denial of service attack. There are three kinds of JellyFish attacks i. e. JF Reorder Attack, JF Periodic Dropping Attack, JF Delay Variance Attack. In JF delay variance attack, intruder node needs to intrude into forwarding group and then it delays data packets for some amount of time before forwarding. Due to JF delay variance attack, high end- to- end delay takes place in the network and performance of the network (i. e. throughput etc) becomes worse. In our paper we have done a comparative performance analysis of three reactive routing protocols i. e. AODV, DSR and TORA used in mobile ad hoc network under JF delay variance attack with increasing node density. If we have a mobile ad hoc network in which probability of occurrence of JF attack is high and also if it requires time efficient network service for information exchange with increasing number of nodes then we have to choose DSR protocol. If it requires high throughput and consistent service in the network with increasing node density then TORA protocol is recommended.

关键词： JF Delay Variance Attack 2ACK AODV DSR TORA

来源：评论

学校读者我要写书评

暂无评论

Concurrent deterministic 1-2 skip list in distributed message passing systems

引用

international JOURNAL OF parallel EMERGENT And distributed SYSTEMS 2015年第2期30卷 135-174页

作者： Singh, Ramesh Chakraborty, Sandip Karmakar, Sushanta Indian Inst Technol Guwahati Dept Comp Sci & Engn Gauhati 781039 Assam India

distributed systems such as the peer-to-peer and the content management systems have to deal with large volume of data stored in several participating nodes. In a distributed environment, concurrent node joins and node leaves impose new design challenges to effectively manage the structure of the system. Deterministic 1-2 skip list is an efficient structure to manage the topology of an overlay network. However, the existing works on distributed deterministic 1-2 skip list [(S. Mandal, S. Chakraborty, and S. Karmakar, Deterministic 1-2 skip list in distributed system. in Proceedings of the 2nd ieee international conference on parallel distributed and grid computing, ieee, 2012, pp. 296-301.)] in a decentralised environment do not support concurrency, where multiple parallel join and leave operations may be executed simultaneously. This paper presents a set of algorithms for achieving concurrency in a distributed deterministic 1-2 skip list. The properties and the correctness of the proposed algorithms are analysed theoretically. The proposed set of distributed algorithms for search, join and leave operations has message complexity similar to the centralised versions of the algorithms.

关键词： skip list deterministic concurrency distributed parallelism

来源：评论

学校读者我要写书评

暂无评论

Message from the BigDataMR2012 workshop chairs

Message from the BigDataMR2012 workshop chairs

引用

2nd international conference on Cloud and Green computing, CGC 2012, Held Jointly with the 2nd international conference on Social computing and Its Applications, SCA 2012

作者： Zhang, Xuyun Pandey, Suraj Li, Xiaolin Chen, Jinjun University of Technology Sydney NSW Australia IBM Australia University of Florida United States

ISBN: (纸本)9780769548647

The First international Symposium on Big Data and MapReduce (BigDataMR2012) is co-located with the Second international conference on Cloud and Green computing (CGC2012) held on November 1-3, 2012, Xiangtan, Hunan, China. Big data is an emerging paradigm applied to datasets whose size is beyond the ability of commonly used software tools to capture, manage, and process the data within a tolerable elapsed time. Such datasets are often from various sources (Variety) yet unstructured such as social media, sensors, scientific applications, surveillance, video and image archives, Internet texts and documents, Internet search indexing, medical records, business transactions and web logs;and are of large size (Volume) with fast data in/out (Velocity). Various technologies are being discussed to support the handling of big data such as massively parallel processing databases, scalable storage systems, cloud computing platforms, and MapReduce. MapReduce is a distributed programming paradigm and an associated implementation to support distributed computing over large datasets on cloud. This symposium aims at providing a forum for researchers, practitioners and developers from different background areas such as cloud computing, distributed computing and database area to exchange the latest experience, research ideas and synergic research and development on fundamental issues and applications about big data and MapReduce in cloud environments. BigDataMR2012 contains 9 papers. Each of them was peer reviewed by at least three program committee members. The symposium covers a broad range of topics in the field of Big Data and MapReduce. © 2012 ieee.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Unifying Explicit and Implicit Feedback for Top-N Recommendation 2

Unifying Explicit and Implicit Feedback for Top-N Recommenda...

引用

2017 ieee 2nd international conference on Big Data Analysis（ICBDA 2017）

作者： Siping Liu Xiaohan Tu Renfa Li College of Computer Science and Electronic Engineering Hunan University

ISBN: (纸本)9781509036202

In the era of big data,the data are diverse and *** issue that using multi-source data efficiently in recommender system is very *** solve this problem,we proposes a ranking model that integrates explicit feedback data with implicit feedback data *** use weighting factors to measure the impact of different user behaviors on recommendation *** solved the data fusion problem and the Top-N items recommendation *** used matrix decomposition for collaborative ***,a parallel optimization model based on distributed and parallel computing is proposed,and the implementation on Spark is *** comparison with several models,our model greatly enhanced the items recommendation quality and improved the scalability and efficiency of personalized recommender systems.

关键词： component Recommender systems Implicit and explicit feedback Collaborative Filtering Top-N recommendation

来源：评论

学校读者我要写书评

暂无评论

Transforming an incorrectly synchronized parallel program into correctly synchronized and well optimized program

Transforming an incorrectly synchronized parallel program in...

引用

international conference on parallel distributed and grid computing (pdgc)

作者： Abdourahmane Senghor Karim Konate Department of Mathematics and Informatics Cheikh Anta Diop University Dakar Senegal

We propose to design a source-to-source parallelizing tool that transforms an incorrectly synchronized Jomp parallel program into a correctly synchronized and well-optimized program. The tool deals with the primitive variables accesses (read/write). The approach consists of (1) analyzing variables accesses and dependences between statements, (2) slicing the program into independent subsets of statements (3) combining all accesses of each variable (4) and finally enforcing a set of transformation rules. The tool aims to be less error-prone and to generate optimized code. We've proved the feasibility of that tool by applying by hand the transformation rules. Experimental results reveal that programs dealt with the tool can achieve better performance gain.

关键词： Synchronization Java Reactive power Instruction sets grid computing parallel programming

来源：评论

学校读者我要写书评

暂无评论

Task scheduling through limited duplication with processor utilization in grid computing system

Task scheduling through limited duplication with processor u...

引用

international conference on parallel distributed and grid computing (pdgc)

作者： Neha Agarwal Chhavi Gupta Ankit Khare Department of CSE and ICT Jaypee University of Information Technology Solan Himachal Pradesh India

In dependent task scheduling algorithms, task duplication is the finest scheduling technique for minimizing the response time of workflow application in grid computing system. When we apply task duplication scheduling algorithm on workflow application, we get shorter schedules (makespan) but it has one limitation that grid node can be overloaded due to duplications of tasks. In this paper we are proposing an algorithm in which we are focusing on three points (1) reducing makespan (2) reducing tasks duplication, and (3) achieving better processor utilization. For this we have suggested an algorithm (TLD-P) which is achieving good results for considered parameters as compared to the existing HLD and EDS-G algorithm.

关键词： Task analysis Nickel Computational modeling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：