A Systematic Method for Reliability Index Evaluation of Distribution Networks in the Presence of Distributed Generators

Chehardeh, Maziar Isapour; Hatziadoniu, Constantine J.

doi:10.1109/naps.2018.8600574

Cited by 3 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, the heterogeneity of the servers is different from the perspective of different task types which makes the scheduling problem for such a system much harder than the homogeneous scenario, where the general case is the affinity scheduling problem which is an open problem. Such a system model fits into the MapReduce applications which are widely being used in Hadoop [7], Google's MapReduce [8], grid-computing [9], [10], [11], [12], and Dryad [13]. MapReduce is the de facto standard in processing big data, where the big data-set is divided into typical small chunks of data of size 128 MB and each chunk of data is replicated on a number of servers, where the default in Hadoop is three servers.…”

Section: Introductionmentioning

confidence: 99%

The Power of d Choices in Scheduling for Data Centers with Heterogeneous Servers

Moaddeli¹,

Ahmadi²,

Abhar³

2019

Preprint

View full text Add to dashboard Cite

MapReduce framework is the de facto in big data and its applications, in which the big data-set is split into small data chunks and the data chunks are replicated on different servers, three servers by default, among thousands of servers. The heterogeneous server structure of the system, where the pair task-server determines the task processing speed, makes the scheduling much harder than scheduling for systems with homogeneous servers. Throughput optimality of the system on one hand and delay optimality on the other hand creates a dilemma for assigning tasks to servers. Unless many research has been done on both heuristic and theoretical algorithms for scheduling for such a system with multi-level data locality, the optimal scheduling algorithm is still an open problem. The JSQ-MaxWeight and Balanced-Pandas algorithms are the states of the arts algorithms with theoretical guarantees on throughput and delay optimality for systems with two and three levels of data locality. However, the scheduling complexity of these two algorithms are way too much. Hence, we use the power of d choices algorithm combined with the Balanced-Pandas algorithm and the JSQ-MaxWeight algorithm, and compare the complexity of the simple algorithms and the power of d choices versions of them. We will further show that the Balanced-Pandas algorithm combined with the power of the d choices, Balanced-Pandas-Pod, not only performs better than simple Balanced-Pandas, but also is less sensitive to the parameter d than the combination of the JSQ-MaxWeight algorithm and the power of the d choices, JSQ-MaxWeight-Pod. In fact in our extensive simulation results, the Balanced-Pandas-Pod algorithm is performing better than the simple Balanced-Pandas algorithm in low and medium loads, where data centers are usually performing at, and performs almost the same as the Balanced-Pandas algorithm at high loads. The reason is that the combination of the two algorithms enhances the data locality of tasks and prioritize local and rack local service to remote service more than the Balanced-Pandas algorithm. Note that the load balancing complexity of Balanced-Pandas and JSQ-MaxWeight algorithms are O(M ), where M is the number of servers in the system which is in the order of thousands servers, whereas the complexity of Balanced-Pandas-Pod and JSQ-MaxWeight-Pod are O(1), that makes the central scheduler faster and saves energy. Moreover, as mentioned, our proposed Balanced-Pandas-Pod has better performance than the existing algorithms that makes it superior to the state-of-the-art algorithms.

show abstract

Section: Introductionmentioning

confidence: 99%

The Power of d Choices in Scheduling for Data Centers with Heterogeneous Servers

Moaddeli¹,

Ahmadi²,

Abhar³

2019

Preprint

View full text Add to dashboard Cite

show abstract

Robustness Comparison of Scheduling Algorithms in MapReduce Framework

Daghighi

Chen

2021

Lecture Notes in Networks and Systems

View full text Add to dashboard Cite

Optimal Placement of Remote-Controlled Switches in Distribution Networks in the Presence of Distributed Generators

Chehardeh

Hatziadoniu

2019

Energies

Self Cite

View full text Add to dashboard Cite

A two-level optimization method is presented to find the optimal number and location of conventional protective devices to be upgraded to remote-controlled switches (RCSs) for an existing distribution network (DN). The effect of distributed generation (DG) on this problem is considered. In the first level, a nonlinear binary program is proposed to maximize the restored customers subject to technical and topological constraints. All feasible interchanges between protective devices and ties involved in the restoration, when a fault occurs at all possible locations are found considering switching dependencies. In the second level, a nonlinear cost function, combining the expected cost of interruptions (ECOST) and the switch cost, is minimized with respect to the location of RCSs. The expected cost function is computed based on the optimum restoration policies obtained from the first level. The optimum placement of RCSs using the proposed algorithm is tested on a 4-feeder 1069-node test system and compared to the solution obtained with a genetic algorithm (GA) on the same system.

show abstract

A Systematic Method for Reliability Index Evaluation of Distribution Networks in the Presence of Distributed Generators

Cited by 3 publications

References 15 publications

The Power of d Choices in Scheduling for Data Centers with Heterogeneous Servers

The Power of d Choices in Scheduling for Data Centers with Heterogeneous Servers

Robustness Comparison of Scheduling Algorithms in MapReduce Framework

Optimal Placement of Remote-Controlled Switches in Distribution Networks in the Presence of Distributed Generators

Contact Info

Product

Resources

About