Abstract: In grid environment, multiple resource providers work together in order to accomplish a complex job. The service level agreement is negotiated between client and a provider for executing the job on high performance computing resources. The performance of the negotiation process highly depends on number of resources selected for the negotiation and process of the negotiation. This paper proposes an advance reservation based resource negotiation using the deviation based resource scheduling algorithm to get commitment of the resources towards the job. The proposed model provides the commitment not only when resources are available but also when resource are not available for that time. The simulations of the proposed model are done on Gridsim simulator. The results are produced. The results indicate the improved performance in terms of number of successful SLA creations and throughput

• Publication Date: 12-Mar-2012
• DOI: 10.15224/978-981-07-1847-3-905
• Views: 0
• Downloads: 0

Abstract: One of the main disadvantages of Orthogonal Frequency Division Multiplexing (OFDM) is its high peak-to- average power ratio (PAPR). As the simplest approach to reducing the PAPR, Clipping based Active Contellation Extention (CB-ACE) exhibits good practicability, and the repeated clipping-and-filtering (RCF) algorithm proposed by Jean Armstrong provides a good performance in PAPR reduction and out-of-band power’s filtering. However, its way of filtering in frequency-domain requires RCF operations to control the peak regrowth, which degrades the bit error rate (BER) performance and greatly increases the computational complexity. Therefore, this paper put forward comparision of two existing techniques namely Exponential Companding Transform and CB-ACE Algorithm. The simulation results show that, exponential Companding Transform gives better result for PAPR Reduction and provides low complexity in Algorithm

• Publication Date: 12-Mar-2012
• DOI: 10.15224/978-981-07-1847-3-914
• Views: 0
• Downloads: 0