CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Mixed Batch and Transactional Workloads for Cloud Computing Jobs

by M. Kalai Selvi, B. Arunkumar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 166 - Number 4
Year of Publication: 2017
Authors: M. Kalai Selvi, B. Arunkumar
10.5120/ijca2017913968

M. Kalai Selvi, B. Arunkumar . Mixed Batch and Transactional Workloads for Cloud Computing Jobs. International Journal of Computer Applications. 166, 4 ( May 2017), 1-5. DOI=10.5120/ijca2017913968

@article{ 10.5120/ijca2017913968,
author = { M. Kalai Selvi, B. Arunkumar },
title = { Mixed Batch and Transactional Workloads for Cloud Computing Jobs },
journal = { International Journal of Computer Applications },
issue_date = { May 2017 },
volume = { 166 },
number = { 4 },
month = { May },
year = { 2017 },
issn = { 0975-8887 },
pages = { 1-5 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume166/number4/27654-2017913968/ },
doi = { 10.5120/ijca2017913968 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:12:46.150911+05:30
%A M. Kalai Selvi
%A B. Arunkumar
%T Mixed Batch and Transactional Workloads for Cloud Computing Jobs
%J International Journal of Computer Applications
%@ 0975-8887
%V 166
%N 4
%P 1-5
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this mixed batch and transactional workloads for cloud computing jobs we implemented a technique that manages a long running jobs and OLTP it contains mixed workloads of all the types like word, video and image. In this process job scheduler plays an important role, it is assigned for managing workloads and also is an application for controlling non viewing or unattended background program process or execution. Our proposed and implementation process is, it allows miscellaneous workloads are to be collected on any one of the server machine so that we can able to reduce the decision making process of resource allocation. In the previous paper the workloads of any type to be allotted to nearest server it leads long time to complete the process and also minimum bandwidth process is also delayed to overcome this Problem we analyses certain process that first the workloads to be analyzed and it be allotted for the server using the resource allocation and scheduler. We reveal that our technique maximizes mixed workload performance while providing service demarcation based on complex performance goals.

References
  1. Amazon Elastic Compute Cloud [Online]. Available: www.aws.amazon.com/ec2 Q2
  2. Google App Engine [Online]. Available: www.code.google. com/appengine/
  3. Windows Azure Platform [Online]. Available: ww.microsoft.com/windowsazure/
  4. H. Rodrigues, J. R. Santos, Y. Turner, P. Soares, and D. Guedes, “Gatekeeper: Supporting bandwidth guarantees for multi-tenant datacenter networks,” in Proc. 3rd Conf. I/O Virtualization, 2011, p. 6.
  5. H. Ballani, P. Costa, T. Karagiannis, and A. Rowstron, “Towards predictable datacenter networks,” in Proc. ACM SIGCOMM Conf., 2011, pp. 242–253.
  6. N. G. Duffield, P. Goyal, A. Greenberg, P. Mishra, K. Ramakrishnan, and J. E. Van der Merwe, “Resource management with hoses: Point-to-cloud services for virtual private networks,” IEEE/ACM Trans. Netw., vol. 10, no. 5, pp. 679–692, Oct. 2002.
  7. D. Xie, N. Ding, Y. C. Hu, and R. Kompella, “The only constant is change: Incorporating Time-varying network reservations in data centers,” in Proc. Conf. Appl., Technol., Archit., Protocols Comput. Commun., 2012, pp. 199–210.
  8. J. Zhu, D. Li, J. Wu, H. Liu, Y. Zhang, and J. Zhang, “Towards bandwidth guarantee in multi-tenancy cloud computing networks,” in Proc. IEEE Int. Conf. Netw. Protocol, 2012, pp. 1–10.
  9. V. Jalaparti, H. Ballani, P. Costa, T. Karagiannis, and A. Rowstron, “Bridging the tenant-provider gap in cloud services,” in Proc. 3rd ACM Symp. Cloud Comput., 2012. pp 1–14.
  10. L. Popa, G. Kumar, M. Chowdhury, A. Krishnamurthy, S. Ratnasamy, and I. Stoica, “Faircloud: Sharing the network in cloud computing,” in Proc. ACM SIGCOMM Conf. Appl., Technol., Archit., Protocols Comput. Commun., 2012, pp. 187–198.
  11. Time and cost optimization algorithm for scheduling multiple workflows in hybrid cloud BA Kumar, T Ravichandran European Journal of Scientific Research 89 (2), 265-275
  12. Scheduling Multiple Workflow Using De-De Dodging Algorithm and PBD Algorithm in Cloud: Detailed Study BA Kumar, T Ravichandran World Academy of Science, Engineering and Technology, International Journal.
  13. A Survey on Determining the Characteristics of Deadlock, Scheduling and Workflow Instances and Providing New Algorithms for the Issues Arising in Hybrid CloudB Arunkumar, T Ravichandran International Journal of Computer Applications 110 (14)
  14. Scheduling Multiple Workflow Using De-De Dodging Algorithm and PBD Algorithm in Cloud: Detailed Study BA Kumar, T Ravichandran World Academy of Science, Engineering and Technology, International Journal
  15. Task Scheduling and Seedblock Based Fault Tolerance in Cloud B Arunkumar, M Kesavamoorthi International Journal of Applied Engineering Research 11 (6), 4428-4432
Index Terms

Computer Science
Information Sciences

Keywords

Cloud Computing Job scheduler Resource allocation Virtualization and Map reduce

Powered by PhDFocusTM