Distributed Processing Environment Research Articles

MapReduce 분산 데이터처리 플랫폼에 기반한 모바일 디바이스 UX 분석

As the concept of web characteristics represented by openness and mind sharing grows more and more popular, device log data generated by both users and developers have become increasingly complicated. For such reasons, a log data processing mechanism that automatically produces meaningful data set from large amount of log records have become necessary for mobile device UX(User eXperience) analysis. In this paper, we define the attributes of to-be-analyzed log data that reflect the characteristics of a mobile device and collect real log data from mobile device users. Along with the MapReduce programming paradigm in Hadoop platform, we have performed a mobile device User eXperience analysis in a distributed processing environment using the collected real log data. We have then demonstrated the effectiveness of the proposed analysis mechanism by applying the various combinations of Map and Reduce steps to produce a simple data schema from the large amount of complex log records.

Cooperative Processing Model for Wireless Sensor Networks

Wireless sensor networks offer a distributed processing environment. Many sensor nodes are deployed in fields that have limited resources such as computing power, network bandwidth, and electric power. The sensor nodes construct their own networks automatically, and the collected data are sent to the sink node. In these traditional wireless sensor networks, network congestion due to packet flooding through the networks shortens the network life time. Clustering or in-network technologies help reduce packet flooding in the networks. Many studies have focused on saving energy in the sensor nodes because the limited available power leads to an important problem of extending the operation of sensor networks as long as possible. However, we focus on the execution time because clustering and local distributed processing already contribute to saving energy by local decision making. In this paper, we present a cooperative processing model based on the processing timeline. Our processing model includes validation of the processing, prediction of the total execution time, and determination of the optimal number of processing nodes for distributed processing in wireless sensor networks. The experiments demonstrate the accuracy of the proposed model, and a case study shows that our model can be used for the distributed application.

A Smart Algorithm for Dynamic Task Allocation for Distributed Processing Environment

A Distributed Processing Environment (DPE) consists of multiple autonomous computers that communicate through a communication media. In DPE a task is divided into many fractions and each of which is to be get processed. The task allocation problem can be explained in terms of number of tasks and number of processors available. In the present method propose a dynamic model for task allocation in DPE. Present method describes the allocation of m tasks in the environment of distributed processing with n processors (m>n) that completes in k number of phases. This method allocates the tasks to the processor to increases the performance of the DPE; and based on the inter task communication cost between executing task and another tasks. Residing cost and reallocation cost in various phases has also taken in consideration. On implemented the suggested algorithm we have obtained the phase wise optimal allocation and overall optimal cost. The run time complexity has been computed and compared with existing approaches. It is found that suggested algorithm is much better as compared to others.

OpenSees: A Framework for Earthquake Engineering Simulation

Structural engineers face many challenges in attempting to analyze and design structures that can withstand the devastating effects of earthquakes. The OpenSees software framework seeks to aid in this challenging task by letting earthquake engineers develop finite-element and finite-element-reliability applications for use in sequential, high-performance, and distributed processing environments.

A Modified and Efficient Algorithm for Static Task Assignment in Distributed Processing Environment

The Distributed Processing Environment [DPE] in which services provided for the network reside at multiple sites. Instead of single large machine being responsible for all aspects of process, each separate processor handles subset. In the distributed environments the program or tasks are also often developed with the subsets of independent units under various environments. The Allocation problems in any computer system play the key role for deciding the performance of the system. The allocation put the direct impact of software resources as well as hardware resources. In DPE, partitioning of the application software in to module and the proper allocation of these modules dissimilar processors are important factors, which determine the efficient utilization of resources. The static model discussed in this paper provide an optimal solution for assigning a set of “m” modules of a task to a set of “n” processors where m > n in a distributed system for evaluation for optimal time of the system.

Visual programming support for graph-oriented parallel/distributed processing

SUMMARY GOP is a graph-oriented programming model which aims at providing high-level abstractions for configuring and programming cooperative parallel processes. With GOP, the programmer can configure the logical structure of a parallel/distributed program by constructing a logical graph to represent the communication and synchronization between the local programs in a distributed processing environment. This paper describes a visual programming environment, called VisualGOP, for the design, coding, and execution of GOP programs. VisualGOP applies visual techniques to provide the programmer with automated and intelligent assistance throughout the program design and construction process. It provides a graphical interface with support for interactive graph drawing and editing, visual programming functions and automation facilities for program mapping and execution. VisualGOP is a generic programming environment independent of programming languages and platforms. GOP programs constructed under VisualGOP can run in heterogeneous parallel/distributed systems. Copyright c

Effective reformulations for task allocation in distributed systems with a large number of communicating tasks

In any distributed processing environment, decisions need to be made concerning the assignment of computational task modules to various processors. Many versions of the task allocation problem have appeared in the literature. Intertask communication makes the assignment decision difficult; capacity limitations at the processors increase the difficulty. This problem is naturally formulated as a nonlinear integer program, but can be linearized to take advantage of commercial integer programming solvers. While traditional approaches to linearizing the problem perform well when only a few tasks communicate, they have considerable difficulty solving problems involving a large number of intercommunicating tasks. This paper introduces new mixed integer formulations for three variations of the task allocation problem. Results from extensive computational tests conducted over real and generated data indicate that the reformulations are particularly efficient when a large number of tasks communicate, solving reasonablylarge problems faster than other exact approaches available.

Terminal-centric view of software. reconfigurable system architecture and enabling components and technologies

Reconfigurable radio in Europe is rapidly gaining momentum and becoming a key enabler for realizing the vision of being optimally connected anywhere, anytime. At the center of this exciting technology is the reconfigurable terminal that will move across different radio access networks, adapting at every instant to an optimum mode of operation. This will require coordinated reconfiguration management support from both the terminal and the network, but the terminal will inherit a significant part of this intelligence. This article focuses on a novel reconfigurable terminal architecture that advances the state of the art and encompasses the overall protocol stack from the physical to application layer in IP-based radio access networks. The proposed architecture is composed of a terminal reconfiguration management part and enabling middleware technologies like the complementary Distributed Processing Environment and agent platforms, flexible protocol stacks that can flexibly be interchanged to support different wireless technologies and associated mechanisms, and finally, object-oriented reconfigurable RF and baseband components. The work presented in this article is conducted in the context of the IST projects SCOUT (www.ist-scout.org) and TRUST (www4.in.tum.de/-scout/trust webpage/spl I.bar/src/ trust frameset.html) of the European 5th Framework Program.

Broadcasting Spanning Forests on a Multiple-Access Channel

The problem of finding a spanning forest of a graph in a distributed-processing environment is studied. If an input graph is weighted, then the goal is to find a minimum-weight spanning forest. The processors communicate by broadcasting. The output consists of the edges that make a spanning forest and have been broadcast on the network. Input edges are distributed among the processors, with each edge held by one processor. The underlying broadcast network is implemented as a multiple-access channel. If exactly one processor attempts to perform a broadcast, then the broadcast is successful. A message broadcast successfully is delivered to all the processors in one step. If more than one processors broadcast simultaneously, then the messages interfere with each other and no processor can receive any of them. Optimality of algorithmic solutions is investigated, by way of comparing deterministic with randomized algorithms, and adaptive with oblivious ones. Lower bounds are proved that either justify the optimality of specific algorithms or show that the optimal performance depends on a class of algorithms.

CORBA based design and implementation of universal personal computing

Universal personal computing (UPC) supports nomadic computing at user mobility and at terminal mobility levels in a user-friendly way. That is, a user can access computing resources anywhere on the Internet, using any available mobile or stationary terminal attached to any subnet supporting UPC services. These services are provided via agents and enable a personalized computing environment that is familiar to or customized by the user and independent of the terminal and subnet, utilizing locally available facilities. Hence, UPC requires a homogenous distributed processing environment. We selected CORBA as a natural platform-independent framework for UPC, and Java for the implementation of client side objects and agents of UPC. We developed our design of UPC services in SDL, the formal description technique of the ITU-T, and we used ObjectGEODE which is a commercially available tool set supporting object-oriented design and verification of systems. For the implementation of the prototype we selected Borland's VisiBroker which supports Java implementation of the client objects.

JaNeC을 위한 온라인 성능감시기의 설계 및 구현

A performance monitor is indispensable to trace and evaluate performance of a program under distributed processing environment. A performance monitor il classified as off-line and on-line according to its output method. An off-line performance monitor analyzes its performance after a program terminates, and an on-line performance monitor analyzes its one while a program runs. Therefore, the on-line function is essential to analyzing and debugging the program fast. JaNeC, distributed processing environment that is implemented in Java, contains an off-line performance monitor for this. However, this performance monitor may not analyze the program running on JaNeC efficiently. Consequently, this paper explains that an on-line performance monitor is designed and implemented for fast analysis and debugging of the program running on JaNeC. This on-line performance monitor is designed to minimize effects on a program to analyze, and provides various forms of graphic output, to analyze the program effectively. In addition, even after a program terminates, it provides interface with the off-line performance monitor, to analyze again.

A Remote Injection Moulding Simulation System Based on the Internet and the Web

The application service provider (ASP) has become a potential e-business model and software application using an ASP instead of the customer's local installation is expanding rapidly. An approach to building up a remote ASP-oriented simulation tool on the World Wide Web, based on a distributed processing architecture is presented in this paper. The construction approach and key techniques of the system are described in detail. This distributed processing environment can also be used to set up other remote simulation systems.

Continuous media support in the distributed component object model

The demand for a great variety of sophisticated telecommunications services with multimedia characteristics is increasing. This trend highlights the need for the efficient creation of distributed programs with multimedia data exchanges running on distributed processing environments. Therefore, it is necessary to support the object-oriented development of distributed multimedia applications in a flexible manner. This paper recognises Microsoft's Distributed Component Object Model (DCOM) as a key potential technology in the area of service engineering and examines a structured approach to enhance it for the handling of continuous media streams through the design and implementation of a collection of suitable multimedia support services. The proposed approach focuses on the modelling of continuous media communications in DCOM and is validated through the design and implementation of a multimedia conferencing service. Though the approach is targeted to DCOM, the paper lays a set of concrete concepts for realising stream interfaces in distributed object platforms.

Composite reliability evaluation by sequential Monte Carlo simulation on parallel and distributed processing environments

This paper describes two parallel methodologies for composite reliability evaluation using sequential Monte Carlo simulation. The methodologies are based on coarse grain asynchronous implementations. In the first methodology, a complete simulation year is analyzed on a single processor and the many simulated years necessary for convergence are analyzed in parallel. In the second methodology, the adequacy analysis of the system operating states within the simulated years is performed in parallel and the convergence is checked on one processor at the end of each simulated year. The methodologies are implemented on a 10 nodes IBM RS/6000 SP scalable distributed memory parallel computer and on a network of 8 IBM RS/6000 43P workstations. The results obtained in tests with actual power system models showed high speedup and efficiency on both parallel platforms.

Concurrent composite reliability evaluation using the state sampling approach

Abstract This paper presents a parallel methodology for composite reliability evaluation using Monte Carlo simulation by the state sampling approach. The methodology is based on coarse-grain parallelism, in which the adequacy analyses of the sampled system states are performed by different processors and the parallel process convergence is controlled by an asynchronous algorithm. The methodology was implemented on parallel and distributed processing environments: a ten-node IBM RS/6000 SP distributed memory parallel computer and a network of eight IBM RS/6000 43P workstations. The results obtained in tests with actual power system models show high speed-up and efficiency on both platforms and very good scalability.

Trade-off or invention: Experimental integration of active networking and programmable networks

This paper discusses future requirements for enabling rapid service deployment by active networks. To enable the integration of programmable networks and active networking an object-oriented, distributed approach based on Object Request Broker (ORB) technology is presented. A Distributed Processing Environment (DPE) is described as an interoperable service platform, for dynamic and secure service provisioning support. As a platform service, a resource control framework adaptively manages router resource allocation, provides virtual resource abstraction and dynamic partitioning, to achieve the goal of scalable and secure active networking. As an example of active services, advanced reservation is developed and measured to evaluate the performance of object-oriented implementation of network services and the efficiency of underlying resource control paradigm.

Applications of multirate optical fibre code-division-multiplexing systems to high-speed data communications for air traffic control

AbstractFuture air traffic control will be based on the distributed processing environment. This leads to the use of high-speed optical fibre networks and systems to connect many processors (for both general and specific purposes) and workstations in the air traffic control centres. To efficiently support such applications, communication systems should be capable of multirate operations. To achieve this aim, we propose an efficient optical fibre code-division multiplexing (OF-CDM) technique that can support multirate data communications without any increase of system complexity when compared with the equal-rate operation case. Unlike conventional optical orthogonal codes (OOCs), the use of our proposed unequal-length OOCs can eliminate any possible violation of the minimum cross-and auto-correlation constraint (i.e. ‘1’) in multirate OF-CDM systems. Thus, using unequal-length OOCs can achieve a better bandwidth efficiency and a lower bit error rate for multirate transmissions than employing conventional OOCs. Moreover, we present the design of cost-effective OF-CDM transmitters for multirate data transmissions. The proposed systems can be also employed to support future airborne real-time data distributions and computer interconnects.

Mobile agent and CORBA technologies in the broadband intelligent network

This article presents an IN architecture that is based on distributed object and mobile agent technologies. It deviates from traditional IN in two prominent ways: first, by substituting message-based protocols with a CORBA distributed processing environment. The new communications infrastructure not only serves to convey IN flows, but also functions as a potent unifying location-transparent layer. Second, the new architecture makes heavy use of mobile agent technology. Service logic programs are implemented as mobile agents, and are thus not constrained to control the switch's operations remotely from a central location. Instead, they can migrate and control its operations locally. The infrastructure elements of the architecture exploit this ability of service logic programs by cloning them and dragging their clones to the appropriate locations in response to excess processing or signaling load. The architecture is in this way self-balancing, in contrast to the centralized nature of traditional IN. A prototype implementation is presented along with a service creation framework that enables the IN service designer to disregard environment-related issues and concentrate on the IN logic of the services per se.

An integrated management environment for network resources and services

Technological and human factors have contributed to increase the complexity of the network management problem. Heterogeneity and globalization of network resources, on one hand, have increased user expectations for flexible and easy-to-use environments; on the other hand, they have suggested entirely novel ways to face the management problem. Several research efforts recognize the need for integrated solutions to manage both network resources and services in open, global, and untrusted environments. In addition, these solutions should permit the coexistence of different management models and should interoperate with legacy systems. In the paper, we define a general architecture based on a distributed processing environment (DFE) that offers a large set of facilities to the application level. We have developed the MESIS management environment shaped after the above architecture and its DPE facilities with mobile agents technology. MESIS handles, in a uniform way, both resources and services, and focuses on two crucial properties: interoperability to overcome heterogeneity, and security to grant users safe and protected operations. The Agent Interoperability Facility supports compliance with CORBA-based management systems and with MASIF agent platforms. The Agent Security Facility provides authentication, integrity, privacy, authorization, and secure interoperation with CORBA systems.

Control and management in next-generation networks: challenges and opportunities

This article discusses the challenges and opportunities associated with a fundamental transformation of current networks toward a multiservice ubiquitous infrastructure with a unified control and management architecture. After articulating the major driving forces for network evolution, we outline the fundamental reasons why neither the control infrastructure of the PSTN nor that of the present-day Internet is adequate to support the myriad of new services in next-generation networks. Although NGN will inherit heavily from both the Internet and the PSTN, its control and management architecture is likely to be radically different from both, and will be anchored on a clean separation between a QoS-enabled transport/network domain and an object-oriented service/application domain, with a distributed processing environment that glues things together and universally addresses issues of distribution, redundancy, and concurrency control for all applications. Finally, we allude to the transition issues and show how voice-over-packet services are emerging as the bootstrap application for marshaling in the NGN architecture.