Discussion on the Parallelism and Classification of Cloud Computing Tasks
Cloud computing basic platform can propose different requirements for storage and computation in face of different users during its operation. Whether multiple nodes are adapted to store and process one problem at the same time has to take the characteristics of parallelism of the task into consideration. The parallelism of serial program has not been found a universal model to resolute automatically up to date. For one computational process, loop structure is not only the one that appears most frequent in program design, but one structure that occupies system computation resource mainly, therefore, doing research on the problem of parallelism of loop program is one most import aspect. The article studies the correlation between computational data and data partitioning method when executing computation. From the perspective whether the task can be processed in parallel, cloud computing tasks are classified.
Key words: Cloud Computing; Parallelism; Dependency Analysis; Loop Structure
- There are currently no refbacks.
How to do online submission to another Journal?
If you have already registered in Journal A, then how can you submit another article to Journal B? It takes two steps to make it happen:
1. Register yourself in Journal B as an Author
Find the journal you want to submit to in CATEGORIES, click on “VIEW JOURNAL”, “Online Submissions”, “GO TO LOGIN” and “Edit My Profile”. Check “Author” on the “Edit Profile” page, then “Save”.
Go to “User Home”, and click on “Author” under the name of Journal B. You may start a New Submission by clicking on “CLICK HERE”.
We only use three mailboxes as follows to deal with issues about paper acceptance, payment and submission of electronic versions of our journals to databases:
firstname.lastname@example.org; email@example.com; firstname.lastname@example.org
Copyright © 2010 Canadian Research & Development Centre of Sciences and Cultures
Address: 730, 77e AV, Laval, Quebec, H7V 4A8, Canada
Telephone: 1-514-558 6138