Name
Abstract | ||
|---|---|---|
In this paper two new heuristics, named Min–min-C and Max–min-C, are proposed able to provide near-optimal solutions to the mapping of parallel applications, modeled as Task Interaction Graphs, on computational clouds. The aim of these heuristics is to determine mapping solutions which allow exploiting at best the available cloud resources to execute such applications concurrently with the other cloud services. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.future.2014.02.019 | Future Generation Computer Systems |
Keywords | Field | DocType |
Cloud computing,Mapping,Communicating tasks,Heuristics | Cloud resources,Graph,Supercomputer,Computer science,Robustness (computer science),Real-time computing,Heuristics,Statistical hypothesis testing,Distributed computing,Cloud computing | Journal |
Volume | ISSN | Citations |
37 | 0167-739X | 9 |
PageRank | References | Authors |
0.49 | 42 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ivanoe De Falco | 1 | 242 | 34.58 |
| Umberto Scafuri | 2 | 116 | 16.33 |
| Ernesto Tarantino | 3 | 361 | 42.45 |