Optimal scheduling algorithm for distributed-memory machines

Darbha, S.; Agrawal, Dharma P.

doi:10.1109/71.655248

Cited by 166 publications

(98 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…we can devise DVS algorithms that avoid wasting cycles (hence "cycle conserving") by plummeting the operating frequency. This is rather similar to slack time stealing [10].…”

Section: Cycle-conserving Rt-dvs (Cc-dvs)mentioning

confidence: 81%

A Metaphorical Research on Diversified Approaches of DVS Enabled Energy - Aware Cloud Data Centers under the Cloudsim Platform

C.Saranya¹

2015

IJIRCCE

View full text Add to dashboard Cite

Energy has turn into one of the majority critical issues. Energy-efficient designs encompass engage in recreation significance roles for hardware as fine as software implementations. Energy-efficiency can be achieved by adopting the dynamic voltage scaling (DVS) scheme. DVS has been a solution scheme in exploiting to reduce energy dissipation by lowering the supply voltage and operating occurrence. In this dissertation we anticipated diversified approaches on DVS enabled Energy aware Cloud Data centers. DVS has implemented on every approaches with different mechanisms and it provides energy saving and different advantaged features of the system. The scrutiny of research would give the instruction concerning what has been done previously in the same area, what is the in attendance tendency and what are the other related areas, Comparison of algorithms imposed with DVS features under the Cloudsim. The analysis has resultant that the DVS has reduced the power and improve the system utilization.

show abstract

“…we can devise DVS algorithms that avoid wasting cycles (hence "cycle conserving") by plummeting the operating frequency. This is rather similar to slack time stealing [10].…”

Section: Cycle-conserving Rt-dvs (Cc-dvs)mentioning

confidence: 81%

A Metaphorical Research on Diversified Approaches of DVS Enabled Energy - Aware Cloud Data Centers under the Cloudsim Platform

C.Saranya¹

2015

IJIRCCE

View full text Add to dashboard Cite

show abstract

“…V = {v 1 , v 2 , ..., v n } represents a set of precedence-constrained parallel tasks, and t i is the ith task's computation requirement showing the number of time units to compute v i , 1 ≤ i ≤ n. It is assumed that all the tasks in V are nonpreemptive and indivisible work units, and a similar assumption can be found in related studies [9] [20]. (v i , v j )∈ E is a message transmitted from task v i to v j , and c ij is the communication cost of the message (v i , v j ) ∈ E. We assume in this study that there is one entry task and one exit task for an application with a set of tasks.…”

Section: The Task Modelmentioning

confidence: 99%

Energy-Aware Duplication Strategies for Scheduling Precedence-Constrained Parallel Tasks on Clusters

Zong

Manzanares

Stinar

et al. 2006

2006 IEEE International Conference on Cluster Computing

View full text Add to dashboard Cite

show abstract

“…Medium: A prerequisite for useful communication is that two objects have a compatible medium in which both objects can communicate. Aura: The sub-space which effectively bounds the presence of an object within a given medium and which acts as an enabler of potential interaction [5]. In each particular medium, it is possible to delimit the observing object's interest.…”

Section: Reinterpreting the Smi Key Conceptsmentioning

confidence: 99%

Teaching about Madrid: A Collaborative Agents-Based Distributed Learning Course

Bosque

Herrero

Mata

2008

On the Move to Meaningful Internet Systems: OTM 2008 Workshops

View full text Add to dashboard Cite

Abstract.Interactive art courses require a huge amount of computational resources to be running on real time. These computational resources are even bigger if the course has been designed as a Virtual Environment with which students can interact. In this paper, we present an initiative that has been develop in a close collaboration between two Spanish Universities: Universidad Politécnica de Madrid and Universidad Rey Juan Carlos with the aim of join two previous research project: a Collaborative Awareness Model for TaskBalancing-Delibery (CAMT) in clusters and the "Teaching about Madrid" course, which provides a cultural interactive background of the capital of Spain.

show abstract

Optimal scheduling algorithm for distributed-memory machines

Cited by 166 publications

References 12 publications

A Metaphorical Research on Diversified Approaches of DVS Enabled Energy - Aware Cloud Data Centers under the Cloudsim Platform

A Metaphorical Research on Diversified Approaches of DVS Enabled Energy - Aware Cloud Data Centers under the Cloudsim Platform

Energy-Aware Duplication Strategies for Scheduling Precedence-Constrained Parallel Tasks on Clusters

Teaching about Madrid: A Collaborative Agents-Based Distributed Learning Course

Contact Info

Product

Resources

About