A scheduling scheme is proposed to reduce execution time by means of both checkpoint sharing and task duplication under a peer-to-peer(P2P) architecture. In the scheme, the checkpoint executed by each peer(i.e., a res...A scheduling scheme is proposed to reduce execution time by means of both checkpoint sharing and task duplication under a peer-to-peer(P2P) architecture. In the scheme, the checkpoint executed by each peer(i.e., a resource) is used as an intermediate result and executed in other peers via its duplication and transmission. As the checkpoint is close to a final result, the reduction of execution time for each task becomes higher, leading to reducing turnaround time. To evaluate the performance of our scheduling scheme in terms of transmission cost and execution time, an analytical model with an embedded Markov chain is presented. We also conduct simulations with a failure rate of tasks and compare the performance of our scheduling scheme with that of the existing scheme based on client-server architecture. Performance results show that our scheduling scheme is superior to the existing scheme with respect to the reduction of execution time and turnaround time.展开更多
We show that in a Q-doubling space （X, d, μ）, Q 〉 1, which satisfies a chain condition, if we have a Q-Poincare inequality for a pair of functions （u, g） where g ∈ LQ（X）, then u has Lebesgue points 7-th-a.e. ...We show that in a Q-doubling space （X, d, μ）, Q 〉 1, which satisfies a chain condition, if we have a Q-Poincare inequality for a pair of functions （u, g） where g ∈ LQ（X）, then u has Lebesgue points 7-th-a.e. for h（t） = log1-Q-c（1/t）. We also discuss how the existence of Lebesgue points follows for u ∈ W1,Q（x） where （X, d, μ） is a complete Q-doubling space supporting a Q-Poincar; inequality for Q 〉 1.展开更多
基金supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2012R1A1A4A0105777)supported by the MSIP (Ministry of Science, ICT and Future Planning), Korea, under the ITRC (Information Technology Research Center) support program (NIPA-2013-H030113-4007) supervised by the NIPA (National IT Industry Promotion Agency)
文摘A scheduling scheme is proposed to reduce execution time by means of both checkpoint sharing and task duplication under a peer-to-peer(P2P) architecture. In the scheme, the checkpoint executed by each peer(i.e., a resource) is used as an intermediate result and executed in other peers via its duplication and transmission. As the checkpoint is close to a final result, the reduction of execution time for each task becomes higher, leading to reducing turnaround time. To evaluate the performance of our scheduling scheme in terms of transmission cost and execution time, an analytical model with an embedded Markov chain is presented. We also conduct simulations with a failure rate of tasks and compare the performance of our scheduling scheme with that of the existing scheme based on client-server architecture. Performance results show that our scheduling scheme is superior to the existing scheme with respect to the reduction of execution time and turnaround time.
基金supported by the Academy of Finland via the Centre of Excellence in Analysis and Dynamics Research(Grant No.271983)
文摘We show that in a Q-doubling space （X, d, μ）, Q 〉 1, which satisfies a chain condition, if we have a Q-Poincare inequality for a pair of functions （u, g） where g ∈ LQ（X）, then u has Lebesgue points 7-th-a.e. for h（t） = log1-Q-c（1/t）. We also discuss how the existence of Lebesgue points follows for u ∈ W1,Q（x） where （X, d, μ） is a complete Q-doubling space supporting a Q-Poincar; inequality for Q 〉 1.
