This paper presents Visper, a novel object-oriented framework that identifies and enhances common services and programming primitives, and implements a generic set of classes applicable to multiple programming models ...
详细信息
This paper presents Visper, a novel object-oriented framework that identifies and enhances common services and programming primitives, and implements a generic set of classes applicable to multiple programming models in a distributed environment. Groups of objects, which can be programmed in a uniform and transparent manner, and agent-based distributed system management, are also featured in Visper. A prototype system is designed and implemented in Java, with a number of visual utilities that facilitate program development and portability, As a use case, Visper integrates parallelprogramming in an MPI-like message-passing paradigm at a high level with services such as checkpointing and fault tolerance at a lower level. The paper reports a range of performance evaluation on the prototype and compares it to related works.
We present Navigational programming (NavP) - a distributed parallel programming methodology based on the principles of migrating computations and multithreading. The four major steps of NavP are: (1) Distribute the da...
详细信息
ISBN:
(纸本)9781424405244
We present Navigational programming (NavP) - a distributed parallel programming methodology based on the principles of migrating computations and multithreading. The four major steps of NavP are: (1) Distribute the data using the data communication pattern in a given algorithm;(2) Insert navigational commands for the computation to migrate and follow large-sized distributed data;(3) Cut the sequential migrating thread and construct a mobile pipeline;and (4) Loop back for refinement. NavP is significantly different from the current prevailing Message Passing (MP) approach. The advantages of NavP include: (1) NavP is structured distributedprogramming and it does not change the code structure of an original algorithm. This is in sharp contrast to MP as MP implementations in general do not resemble the original sequential code;(2) NavP implementations are always competitive with the best MPI implementations in terms of performance. Approaches such as DSM or HPF have failed to deliver satisfying performance as of today in contrast, even if they are relatively easy to use compared to MP;(3) NavP provides incremental parallelization, which is beyond the reach of MP;and (4) NavP is a unifying approach that allows us to exploit both fine- (multithreading on shared memory) and coarse- (pipelined tasks on distributed memory) grained parallelism. This is in contrast to the currently popular hybrid use of MP+OpenMP, which is known to be complex to use. We present experimental results that demonstrate the effectiveness of NavP.
In this work we investigate a supply chain design problem with uncertain final demands for the end products produced by a set of manufacturers. This network of manufacturers has the organizational decisions made inter...
详细信息
In this work we investigate a supply chain design problem with uncertain final demands for the end products produced by a set of manufacturers. This network of manufacturers has the organizational decisions made internally by pooling resources in a cooperative manner and externally by determining the dominant strategic actors that are characterized by the retailer. A non-linear production game (NLPG) is formulated as a mathematical programming problem to describe coalition formation among the manufacturers based on initial contractual agreements. We show that NLPG is a grand coalition game when demand distribution has an increasing generalized failure rate. The conditions that impact the profit allocation in the game including core set, fairness, stability, superadditivity, least-core and SMALL ELEMENT OF-core are defined. A core allocation solution is generated by using an algorithmic approach. This algorithmic solution is tested in a distributed work station network and resulted in attaining strong computational results for the proposed mathematical programming problem;optimization results with 1000 players are determined in 6 min 40 s on a university computer network using parallelprogramming with 52 powerful work stations. The numerical results indicated O(log(-N|)) complexity of the algorithmic solution up to 800 players. To the best of our knowledge, this work is the first of its kind in which distributedparallel processing is implemented in a university work station network with distributed parallel programming and processing for solving a production cooperative game.
In the sequential model of programming, instructions in a program are executed sequentially. Existing, programming languages are mainly designed for the sequential model. As the programming paradigm shifts from the se...
详细信息
ISBN:
(纸本)9783642030949
In the sequential model of programming, instructions in a program are executed sequentially. Existing, programming languages are mainly designed for the sequential model. As the programming paradigm shifts from the sequential to distributed computing, existing sequential programming languages have their limitations. Nevertheless, the sequential languages are the languages which most of programmers are most familiar with. One of the motivations of this research is to implement a framework to support the implementations of distributed applications using Sequential programming languages Such as C/C++, COBOL, and Java. In this paper, we present an implementation of a framework for open distributedprogramming. Allowing programmers to write distributed programs in their favorite sequential programming languages makes the programming paradigm very unique to the existing programming paradigms.
Cognitive Computing is a new and quickly advancing technology. In the last decade Cognitive Computing has been used to assist researchers in their endeavors in many different scientific fields such as Health & med...
详细信息
Cognitive Computing is a new and quickly advancing technology. In the last decade Cognitive Computing has been used to assist researchers in their endeavors in many different scientific fields such as Health & medicine, Education, Marketing, Psychology and Financial Services. On the other hand, parallelprogramming is a more complex concept than sequential programming. The additional complexity of parallelprogramming is introduced by its nature that requires implementations of more complex algorithms and it introduces additional concepts to the developers, namely the communication between the processes (distributed memory systems) that execute the parallel program and their synchronization (Share memory systems). As a result of this additional complexity, a lot of novice developers are reserved in their attempts to implement parallel programs. The objective of this research project was to investigate whether we can assist parallelprogramming process through cognitive computing solutions. In order to achieve our objective, the MPI Assistant, a Q&A system has been developed and a case study has been carried out to determine our application's efficiency in our attempt to assist parallelprogramming developers. The case study showed that our MPI Assistant system indeed helped developers reduce the time they spend to develop their solutions, but not improve the quality of the program or its efficiency as these improvements require features that are out of this research project's scope. However, the case study had limited number of participants, which may affect our results' reliability. As a next step in our attempt to determine if cognitive computing technologies are able to assist developers in their parallelprogramming development, we moved to investigate if cognitive solutions can extract better and more complete responses compared to our manually-created responses that we created for the MPI Assistant. We have experimented with 2 different approaches to the probl
暂无评论