Solving irregularly structured problems based on distributed object model

Sun, Yong; Wang, Cho-Li

doi:10.1016/j.parco.2003.05.006

Cited by 6 publications

(2 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Static load balancing is inapplicable for P2P Grids for two reasons: First, due to differences in processing power, it would be very difficult to estimate the execution time of a task accurately without actually executing the task. This difficulty is even more pronounced for the special but important class of Irregularly Structured Problems (ISP) [34] for which the prediction of the execution time of tasks and the interaction patterns between them is virtually impossible. Second, communication delays are inhomogeneous in WAN setups and in general unpredictable.…”

Section: Load Balancingmentioning

confidence: 99%

Orbweb—A Network Substrate for Peer-to-Peer Desktop Grid Computing Based on Open Standards

2009

View full text Add to dashboard Cite

While Desktop Grid Computing has become a promising alternative to classical Grids for certain kinds of applications, it has not yet reached the same level of standardization. In this article, we present Orbweb, a network substrate for Peer-to-Peer Desktop Grid Computing based on the open industrial-strength eXtensible Messaging and Presence Protocol (XMPP). We discuss, how XMPP can be leveraged to tackle domain-specific challenges, including high scalability, support for volatility, NAT/Firewall traversal, and protocol efficiency. Where XMPP fails to meet these requirements, we contribute pertinent extensions. In particular, we boost the scalability of XMPP by taking load of the XMPP servers through dynamically negotiated direct Peer-to-Peer communication channels between XMPP peers. We pave the way for scalable group membership management by substituting the existing XMPP MultiUser Chat protocol for one that does not suffer from limitations imposed by an »everyone knows everyone« visibility model and allows for deploying custom virtual topologies that best match the interaction patterns of a given application. As efficient multicasting is an essential prerequisite for many distributed algorithms, we adapt the well-known Bimodal Multicast protocol to work in a highly volatile Peer-to-Peer Desktop Grid Computing environment. Finally, we show how to improve the protocol efficiency of XMPP by leveraging a standardized binary encoding of the XML Information Set for XMPP packet transmission. To substantiate the applicability of our approach and the effectiveness of our extensions, we describe how some important higher-level services used in Peer-to-Peer Desktop Grid Computing can be implemented on top of Orbweb and provide a detailed experimental analysis with up to 10K nodes.

show abstract

Section: Load Balancingmentioning

confidence: 99%

Orbweb—A Network Substrate for Peer-to-Peer Desktop Grid Computing Based on Open Standards

2009

View full text Add to dashboard Cite

show abstract

“…In system modeling, dynamic scheduling is required to redistribute the imbalanced workload caused by the system evolution. For example, the N-body problem [53] is an application that simulates the evolution of the physical systems in astrophysics, plasma physics, molecular dynamics, fluid dynamics and other areas. A physical system contains numerous bodies that impose force influences on one another.…”

Section: System Modeling and Simulationmentioning

confidence: 99%

A taxonomy of application scheduling tools for high performance cluster computing

et al. 2006

Self Cite

View full text Add to dashboard Cite

Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper presents a survey on the software tools for the graph-based scheduling on cluster systems with the focus on task scheduling. The tasks of a parallel or distributed application can be properly scheduled onto multi-processors in order to optimize the performance of the program (e.g., execution time or resource utilization). In general, scheduling algorithms are designed based on the notion of task graph that represents the relationship of parallel tasks. The scheduling algorithms map the nodes of a graph to the processors in order to minimize overall execution time.scheduling algorithms have been proposed in the literature, surprisingly not many practical tools can be found in practical use. After discussing the fundamental scheduling techniques, we propose a framework and taxonomy for the scheduling tools on clusters. Using this framework, the features of existing scheduling tools are analyzed and compared. We also discuss the important issues in improving the usability of the scheduling tools.

show abstract

Cost-efficient parallel processing of irregularly structured problems in cloud computing environments

2018

View full text Add to dashboard Cite

Solving irregularly structured problems based on distributed object model

Cited by 6 publications

References 27 publications

Orbweb—A Network Substrate for Peer-to-Peer Desktop Grid Computing Based on Open Standards

Orbweb—A Network Substrate for Peer-to-Peer Desktop Grid Computing Based on Open Standards

A taxonomy of application scheduling tools for high performance cluster computing

Cost-efficient parallel processing of irregularly structured problems in cloud computing environments

Contact Info

Product

Resources

About