ترجمه مقاله زمان بندی کار پویا در Cloud Computing براساس استراتژی حریص(Greedy)

اختصاصی از هایدی ترجمه مقاله زمان بندی کار پویا در Cloud Computing براساس استراتژی حریص(Greedy) دانلود با لینک مستقیم و پر سرعت .

این مقاله ترجمه مقاله انگلیسی Dynamic Task Scheduling in Cloud Computing
Based on Greedy Strategy می باشد ./

سال انتشار : 2013/

ناشر : Springer/

 تعداد صفحات مقاله انگلیسی : 7/

تعداد صفحات فایل ترجمه : 8/

فرمت فایل ترجمه : Word /

مقاله اصلی را به زبان انگلیسی می توانید رایگان از اینجا دریافت فرمایید /

چکیده : 

          زمانبندی کاردر اصل یک  مساله­یNP-completeness در cloud computing است و استراتژی­های زما نبندی کار موجود نمی توانند به طور کامل آن را براورده سازند.

       در این مقاله یک طرح زما نبندی کار پویای ممکن و انعطاف­پذیر (قابل تغییر) DGS که به طور پویا منابع مجازی را به منظور اجرای وظایف محاسباتی اختصاص می­دهد، پیشنهاد شده و بلافاصله زما نبندی راتکمیل می­کند و فرایند را با استفاده از استراتژی حریص بهبود یافته اجرا می کند.

       محیط شبیه سازی  CloudSim به منظور فهمیدن برنامه پیشنهاد شده گسترش­یافته(مبسوط شده)  و نتایج شبیه سازی نشان        می دهد که DGS می­تواند زمان تکمیل کارهای محاسباتی را سرعت بخشد و بکارگیری منابع ابر را برای دستیابی به تعادل بار  (load balance) اصلاح کند.

 

تماس با ما برای راهنمایی یا ترجمه با آدرس ایمیل:

[e-mail]

شماره تماس ما در نرم افزار تلگرام:

[phone] 

 کانال تلگرام‌  @maghalecomputer

 توجه: اگر کارت بانکی شما رمز دوم ندارد، در خرید الکترونیکی به مشکل برخورد کردید و یا به هر دلیلی تمایل به پرداخت الکترونیکی ندارید با ما تماس بگیرید تا راههای دیگری برای پرداخت به شما پیشنهاد کنیم.

Advances in mobile cloud computing systems

اختصاصی از هایدی Advances in mobile cloud computing systems دانلود با لینک مستقیم و پر سرعت .

Advances in mobile cloud computing systems Volume: Author(s): Leung, Victor Chung Ming; Yu, F. Richard Series: Periodical: Publisher: CRC Press/Taylor & Francis Group an Informa Business City: Year: 2016 Edition: Language: English Pages (biblio\tech): 339\0 ISBN: 9781498715140, 1498715141 ID: 1441025 Time added: 2016-01-18 05:00:00 Time modified: 2016-03-20 07:50:50 Library: Library issue: Size: 13 MB (13418679 bytes) Extension: pdf

اختصاصی از هایدی Elastic virtual machine placement in cloud computing network environments دانلود با لینک مستقیم و پر سرعت .

Elastic virtual machine placement in cloud computing network environments

ژورنال:Computer Networks

سال:December 2015

قیمت اصلی:35.59$

Abstract

The growth of cloud computing and the need to support the ever increasing number of applications introduces new challenges and gives rise to various optimization problems, such as calculating the number and location of virtual machines instantiating cloud services to minimize a well-defined cost function. This paper introduces a novel cloud computing network architecture that allows for the formulation of the optimization as an Uncapacitated Facility Location (UFL) problem, where a facility corresponds to an instantiation of a particular service (e.g. a virtual machine). Since UFL is not only difficult (NP-hard and requires global information), but also its centralized solution is non-scalable, the approach followed here is distributed and elastic, and relays local information to improve scalability. In particular, virtual machine replication and merging are proposed and analyzed ensuring overall cost reduction. In addition, a policy that employs virtual machine replication and merging along with migration is proposed to reduce the overall cost for using a service. The efficiency of this policy and its limitations are analyzed and discussed, with simulation results supporting the analytical findings and demonstrating a significant overall cost reduction when the proposed policy is implemented.

Keywords

• Virtual machine,  Elastic placement, Cloud computing, Network architecture, Facility location

اختصاصی از هایدی Cloud computing risk and audit issues دانلود با لینک مستقیم و پر سرعت .

Cloud computing risk and audit issues

ژورنال: Computer Standards & Interfaces

سال: November 2015

قیمت اصلی:35.95

Highlights

•

Identify the risk of cloud computing operations.

•

Identify the risk audit of cloud computing operations.

•

Identify the audit standards of cloud computing operations.

•

Integrating the risk and audit process of cloud computing practice.

---

Abstract

Cloud computing has gained mass popularity in the business environment. However, this technology also imposes some risk concerns, such as weak protection to security and privacy. Since its nature of distant and remote connectivity, the auditing process to this technology becomes challengeable. This paper focuses on issues related to cloud computing risk and audit tasks.

Keywords

• Cloud computing, Auditing,
• Risk factors, Audit standards

اختصاصی از هایدی Modeling of the resource allocation in cloud computing centers دانلود با لینک مستقیم و پر سرعت .

Modeling of the resource allocation in cloud computing centers

ژورنال:Computer Networks

سال: November 2015

قیمت اصلی:35.95$

Abstract

Cloud computing offers on-demand network access to the computing resources through virtualization. This paradigm shifts the computer resources to the cloud, which results in cost savings as the users leasing instead of owning these resources. Clouds will also provide power constrained mobile users accessibility to the computing resources. In this paper, we develop performance models of these systems. We assume that jobs arrive to the system according to a Poisson process and they may have quite general service time distributions. Each job may consist of multiple numbers of tasks with each task requiring a virtual machine (VM) for its execution. The size of a job is determined by the number of its tasks, which may be a constant or a variable. The jobs with variable sizes may generate new tasks during their service times. In the case of constant job size, we allow different classes of jobs, with each class being determined through their arrival and service rates and number of tasks in a job. In the variable case a job generates randomly new tasks during its service time. The latter requires dynamic assignment of VMs to a job, which will be needed in providing service to mobile users. We model the systems with both constant and variable size jobs using birth–death processes. In the case of constant job size, we determined joint probability distribution of the number of jobs from each class in the system, job blocking probabilities and distribution of the utilization of resources for systems with both homogeneous and heterogeneous types of VMs. We have also analyzed tradeoffs for turning idle servers off for power saving. In the case of variable job sizes, we have determined distribution of the number of jobs in the system and average service time of a job for systems with both infinite and finite amount of resources. We have presented numerical results and any approximations are verified by simulation. The results of the paper may be used in the dimensioning of cloud computing centers.

Keywords

• Cloud computing, Queuing systems, Resource allocation, Markov process