A New Cost-Effective Technique for QoS Support in Clusters

Martínez, A.; Alfaro, Francisco J.; Sánchez, José Luis; Quiles, Francisco J.; Duato, J.

doi:10.1109/tpds.2007.1108

Cited by 14 publications

(12 citation statements)

References 31 publications

(30 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the contrary, one of the compensation processes which can actually make up the time deficit is to amend the schedule of the workflow activities which have not commenced, i.e., workflow rescheduling [13], [49]. Workflow rescheduling, such as local rescheduling which deals with the mapping of underling resources to workflow activities within specific workflow segments and global rescheduling within an entire workflow instance, is normally triggered by the violation of QoS constraints [30].…”

Section: Related Workmentioning

confidence: 99%

“…S CIENTIFIC workflow systems can be seen as a type of highlevel middleware services for high-performance computing infrastructures such as cluster, grid, peer-to-peer (p2p), or cloud computing [16], [30], [31], [53]. Scientific workflows usually underlie many complex e-science applications such as climate modeling, disaster recovery simulation, astrophysics, and high-energy physics.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Preventing Temporal Violations in Scientific Workflows: Where and How

Liu

Yang

Jiang

et al. 2011

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Abstract-Due to the dynamic nature of the underlying high-performance infrastructures for scientific workflows such as grid and cloud computing, failures of timely completion of important scientific activities, namely, temporal violations, often take place. Unlike conventional exception handling on functional failures, nonfunctional QoS failures such as temporal violations cannot be passively recovered. They need to be proactively prevented through dynamically monitoring and adjusting the temporal consistency states of scientific workflows at runtime. However, current research on workflow temporal verification mainly focuses on runtime monitoring, while the adjusting strategy for temporal consistency states, namely, temporal adjustment, has so far not been thoroughly investigated. For this issue, two fundamental problems of temporal adjustment, namely, where and how, are systematically analyzed and addressed in this paper. Specifically, a novel minimum probability time redundancy-based necessary and sufficient adjustment point selection strategy is proposed to address the problem of where and an innovative genetic-algorithm-based effective and efficient local rescheduling strategy is proposed to tackle the problem of how. The results of large-scale simulation experiments with generic workflows and specific real-world applications demonstrate that our temporal adjustment strategy can remarkably prevent the violations of both local and global temporal constraints in scientific workflows.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Preventing Temporal Violations in Scientific Workflows: Where and How

Liu

Yang

Jiang

et al. 2011

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

show abstract

“…In our future work we also intend to develop a closed-form solution, thus providing an analytical model for single-buffered MINs incorporating the CBWFQ algorithm on a quad-priority scheme. The provision of QoS with a reduced number of queues, as proposed in [37,62], will be also considered.…”

Section: Discussionmentioning

confidence: 99%

Class-based weighted fair queuing scheduling on quad-priority Delta Networks

Vasiliadis

Rizos

Vassilakis

2012

International Journal of Parallel, Emergent and Distributed Sys

View full text Add to dashboard Cite

Contemporary networks support multiple priorities, aiming to differentiate the quality of service (QoS) levels offered to individual traffic classes. Support for multiple priorities necessitates the introduction of a scheduling algorithm, to select each time the next packet to transmit over the data link. Class-based weighted fair queuing (CBWFQ) scheduling and its variations are widely used as a scheduling technique since it is easy to implement and prevent the low-priority queues from starvation, i.e. receiving no service during periods of high-priority traffic. CBWFQ effectively thus offers low-priority queues, the opportunity to transmit packets even though the high-priority queues are not empty. In this paper, we present the modelling and performance evaluation of a single-buffered, four-priority multistage interconnection network (MIN) operating under the CBWFQ scheduling policy. Performance evaluation is conducted through simulation, and the performance metrics obtained can be used by MIN designers to set the appropriate queue weights according to the expected traffic and the desired QoS levels for each priority class, delivering efficient thus systems.

show abstract

“…The described IBA mechanisms are the base of many techniques proposed for high-performance systems, for instance in [16] or [17]. However, these proposals focus exclusively on QoS provision, while the same IBA mechanisms can be used to provide also congestion management, as proposed in this paper.…”

Section: B Qos Provisionmentioning

confidence: 99%

“…For that reason, with the aim of using a more realistic traffic distribution, we have modeled the Zipf traffic distribution [28]. This traffic model is based on Zipf's law, and it is suitable for the evaluation of high-performance interconnects, as in [29] and [16].…”

Section: B Traffic Modelmentioning

confidence: 99%

Combining HoL-blocking avoidance and differentiated services in high-speed interconnects

Yébenes

Escudero-Sahuquillo

Gómez

et al. 2014

2014 21st International Conference on High Performance Computing (HiPC)

View full text Add to dashboard Cite

Current high-performance platforms such as Datacenters or High-Performance Computing systems rely on highspeed interconnection networks able to cope with the everincreasing communication requirements of modern applications. In particular, in high-performance systems that must offer differentiated services to applications which involve traffic prioritization, it is almost mandatory that the interconnection network provides some type of Quality-of-Service (QoS) and CongestionManagement mechanism in order to achieve the required network performance. Most current QoS and Congestion-Management mechanisms for high-speed interconnects are based on using the same kind of resources, but with different criteria, resulting in disjoint types of mechanisms. By contrast, we propose in this paper a novel, straightforward solution that leverages the resources already available in InfiniBand components (basically Service Levels and Virtual Lanes) to provide both QoS and Congestion Management at the same time. This proposal is called CHADS (Combined HoL-blocking Avoidance and Differentiated Services), and it could be applied to any network topology. From the results shown in this paper for networks configured with the novel, cost-efficient KNS hybrid topology, we can conclude that CHADS is more efficient than other schemes in reducing the interferences among packet flows that have the same or different priorities.

show abstract

A New Cost-Effective Technique for QoS Support in Clusters

Cited by 14 publications

References 31 publications

Preventing Temporal Violations in Scientific Workflows: Where and How

Preventing Temporal Violations in Scientific Workflows: Where and How

Class-based weighted fair queuing scheduling on quad-priority Delta Networks

Combining HoL-blocking avoidance and differentiated services in high-speed interconnects

Contact Info

Product

Resources

About