Routing-Contained Virtualization Based on Up*/Down* Forwarding

Solheim, Åshild Grønstad; Lysne, Olav; Sødring, Thomas; Skeie, Tor; Libak, Jakob Aleksander

doi:10.1007/978-3-540-77220-0_46

Cited by 9 publications

(9 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[25]. However, we are not aware of other strategies than UDFlex [26] that utilize a topology agnostic routing algorithm to achieve routing-containment for irregular partitions. UDFlex is based on the Up*/Down* routing algorithm [27], and assumes that an Up*/Down* graph has been constructed for an interconnection network that connects a number of resources.…”

Section: Related Workmentioning

confidence: 97%

A framework for routing and resource allocation in network virtualization

Solheim

Lysne

Skeie

et al. 2009

2009 International Conference on High Performance Computing (HiPC)

Self Cite

View full text Add to dashboard Cite

Computer architectures for high performance computing have traditionally been based on an assumption of one parallel application running alone on one machine. The current trend is, however, that huge computer installations offer compute power to a set of users or customers, each demanding only a subset of the available compute resources. This places new requirements on the architecture, in that it must support dynamic partitioning of the resources into several virtual servers as demand changes. We introduce a novel framework which supports flexible formation of such virtual servers while preventing interference between the communication of different virtual servers. This paper investigates the impacts of a shared interconnection network on applications running on virtual compute servers. We show that the interconnect performance supplied to each job is highly unpredictable, and that a job can experience a performance degradation of 97% when its traffic interferes with the traffic of concurrent jobs. With a minor reduction in the utilization of each processing node, this can be considerably improved through a combination of routingcontainment in the interconnection network and a carefully designed resource allocation strategy.

show abstract

Section: Related Workmentioning

confidence: 97%

A framework for routing and resource allocation in network virtualization

Solheim

Lysne

Skeie

et al. 2009

2009 International Conference on High Performance Computing (HiPC)

Self Cite

View full text Add to dashboard Cite

show abstract

“…As the traffic of the applications must be isolated, the resources should be assigned in a contiguous way. For this reason, we use a contiguous strategy [13] from the state-of-the-art in order to assign resources to the applications. Note that the resource manager is independent of the reconfiguration mechanism.…”

Section: A Scenariosmentioning

confidence: 99%

NoC Reconfiguration for CMP Virtualization

Triviño

Alfaro

́nchez

et al. 2011

2011 IEEE 10th International Symposium on Network Computing and Applications

View full text Add to dashboard Cite

At NoC level, the traffic interferences can be drastically reduced by using virtualization mechanisms. An effective strategy to virtualize a NoC consists in dividing the network in different partitions, each one serving different applications and traffic flows. In this paper, we propose a NoC reconfiguration mechanism to support NoC virtualization under real scenarios. Dynamic reassignment of network resources to different partitions is allowed in order to NoC dynamically adapts to application needs. Evaluation results show a good behavior of CMP virtualization.

show abstract

“…To maximize the consolidation density, the mapping algorithm should be capable to handle not only regular shape, i.e. rectangle, but also various irregular shapes ignored in previous works [16]. We abstract those irregular shapes into the following three basic types: "L", "⊢", "⊏", as Figure 5 shows, with various rotations and mirrors.…”

Section: Topology Representationmentioning

confidence: 99%

Riso

Yan

Han

et al. 2013

Proceedings of the 50th Annual Design Automation Conference

View full text Add to dashboard Cite

Cloud service providers use workload consolidation technique in many-core cloud processors to optimize system utilization and augment performance for ever extending scale-out workloads. Performance isolation usually has to be enforced for the consolidated workloads sharing the same many-core resources. Networks-on-chip (NoC) serves as a major shared resource, also needs to be isolated to avoid violating performance isolation. Prior work uses strict network isolation to fulfill performance isolation. However, strict network isolation either results in low consolidation density, or complex routing mechanisms which indicates prohibitive high hardware cost and large latency. In view of this limitation, we propose a novel NoC isolation strategy for many-core cloud processors, called relaxed isolation (RISO). It permits underutilized links to be shared by multiple applications, at the same time keeps the aggregated traffic in check to enforce performance isolation. The experimental results show that the consolidation density is improved more than 12% in comparison with previous strict isolation scheme, meanwhile reducing network latency by 38.4% on average.

show abstract

Routing-Contained Virtualization Based on Up/Down Forwarding

Cited by 9 publications

References 20 publications

A framework for routing and resource allocation in network virtualization

A framework for routing and resource allocation in network virtualization

NoC Reconfiguration for CMP Virtualization

Riso

Contact Info

Product

Resources

About