16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008) 2008
DOI: 10.1109/pdp.2008.85
|View full text |Cite
|
Sign up to set email alerts
|

System-Level Virtualization for High Performance Computing

Abstract: System-level virtualization has been a research topic since the 70's but regained popularity during the past few years because of the availability of efficient solution such as Xen and the implementation of hardware support in commodity processors (e.g. Intel-VT, AMD-V).However, a majority of system-level virtualization projects is guided by the server consolidation market. As a result, current virtualization solutions appear to not be suitable for high performance computing (HPC) which is typically based on l… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
21
0

Year Published

2009
2009
2018
2018

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 38 publications
(21 citation statements)
references
References 12 publications
0
21
0
Order By: Relevance
“…(4) defines the minimum resources r(t), in Mflops/s, assigned to a task t that are necessary to complete its remaining workload W (t, µ) in the time from time µ + m ei to the task deadline d t . For example, consider the matrix multiplication algorithm that requires 2n 3 flops for matrices of size (n, n) to compute. If the amount of time available to execute the task is 120 s, the required resource is 2n 3 /120 flops/s.…”
Section: Power-and Failure-aware Scheduling Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…(4) defines the minimum resources r(t), in Mflops/s, assigned to a task t that are necessary to complete its remaining workload W (t, µ) in the time from time µ + m ei to the task deadline d t . For example, consider the matrix multiplication algorithm that requires 2n 3 flops for matrices of size (n, n) to compute. If the amount of time available to execute the task is 120 s, the required resource is 2n 3 /120 flops/s.…”
Section: Power-and Failure-aware Scheduling Algorithmsmentioning
confidence: 99%
“…For example, consider the matrix multiplication algorithm that requires 2n 3 flops for matrices of size (n, n) to compute. If the amount of time available to execute the task is 120 s, the required resource is 2n 3 /120 flops/s. Likewise Stillwell et al [29], we assume that a task t only requires the maximum amount of resources max r(t) necessary to execute at the maximum speed, a value defined by the user.…”
Section: Power-and Failure-aware Scheduling Algorithmsmentioning
confidence: 99%
“…Interestingly, the re-emergence of virtualization [36,37] with its usage in the High Performance Computing (HPC) and grid environment show a great potential as a method for enhancing cloud computing performance. Vallee et.…”
Section: Related Workmentioning
confidence: 99%
“…The service is currently not available. Recent research also suggests that IaaS-based HPC cloud services [31,32] can suffer in performance especially due to VM resource competition and lack of low-latency interconnection needed by specialized parallel engineering simulations.…”
Section: Related and Future Workmentioning
confidence: 99%