This paper tries to define mechanisms which insure the right functionality for systems based on the Volunteer Grid concept and propose a new framework for Volunteer Grid computing management. Volunteer Grid systems al...
详细信息
ISBN:
(纸本)9781424473359
This paper tries to define mechanisms which insure the right functionality for systems based on the Volunteer Grid concept and propose a new framework for Volunteer Grid computing management. Volunteer Grid systems allow setting up high performance computer networks, easily, rapidly and at low costs, the main characteristic of their nodes being the volunteer participation. Thus, a supercomputer is created, able to perform most complex calculations in a relatively short period of time. This volunteering itself is a weakness of the system, because not only physical faults must be taken into consideration, but also sabotages through which participants could try to increase their rating.
Over the Internet today, computing and communications environments are more complex and chaotic than classical distributed systems, lacking any centralized organization or hierarchical control. Peer-to-Peer network ov...
详细信息
Over the Internet today, computing and communications environments are more complex and chaotic than classical distributed systems, lacking any centralized organization or hierarchical control. Peer-to-Peer network overlays provide a good substrate for creating large-scale data sharing, content distribution and application-level multicast applications. We present DistHash, a P2P overlay network designed to share large sets of replicated distributed objects in the context of large-scale highly dynamic infrastructures. The system uses original solutions to achieve optimal message routing in hop-count and throughput, provide an adequate consistency among replicas, as well as provide a fault-tolerant substrate. In this we present result proving that the system is able to scale to a large number of nodes, and it includes the fault tolerance and system orchestration mechanisms, added in order to assess the reliability and availability of the distributed system in an autonomic manner.
This article concerns the hardware iterative decoder for a subclass of LDPC (Low-Density Parity-Check) codes that are implementation oriented. They are known as Architecture Aware LDPC (AA-LDPC). The decoder has been ...
详细信息
This article concerns the hardware iterative decoder for a subclass of LDPC (Low-Density Parity-Check) codes that are implementation oriented. They are known as Architecture Aware LDPC (AA-LDPC). The decoder has been implemented in a form of parameterizable VHDL description. To achieve high clock frequency of the decoder hardware implementation, a large number of pipeline registers has been used in the processing chain. However, the registers increase the processing path delay, since the number of clock cycles required for data propagating is increased. Thus in general the idle cycles must be introduced between decoding subiterations. In this paper we provide a method for calculation the exact number of required idle cycles on the basis of parity check matrix of the code. Then we propose a heuristic algorithm for parity check matrix optimization to minimize the total number of required idle cycles and hence maximize the decoder throughput. The proposed matrix optimization by sorting rows and columns does not change the code properties, however the decoder throughput can be significantly increased.
An improved frequency tracker is proposed for the recently introduced self optimizing narrowband interference canceller (SONIC). The scheme is designed for disturbances with quasi-linear frequency modulation and, unde...
详细信息
An improved frequency tracker is proposed for the recently introduced self optimizing narrowband interference canceller (SONIC). The scheme is designed for disturbances with quasi-linear frequency modulation and, under second-order Gaussian random-walk assumption, can be shown to be statistically efficient. One real-world experiment and several simulations show that a considerable improvement in disturbance rejection may be achieved with the new algorithm.
The SORMSYS project's main goal is to optimize resource management in large scale distributed systems with the capability of self-organization. This paper will present the design of management architecture based o...
详细信息
The SORMSYS project's main goal is to optimize resource management in large scale distributed systems with the capability of self-organization. This paper will present the design of management architecture based on existing middleware solutions through the design of algorithms and methods inspired by natural models. The architecture is full decentralized and it will aim to optimize resource management in different types of distributed systems such as Grid, P2P, and Cloud. The important components considered for the architecture are: allocation of resources, task scheduling, resource discovery, monitoring resources and provide fault tolerance. The SORMSYS project aims to highlights the original obtained results in internationally scientific community. The paper also presents the expecting results and discusses the performance evaluation of proposed architecture.
A large number of scheduling algorithms for large scale distributed systems have been proposed, studied and compared. In spite of this, there are few studies comparing the performance of scheduling algorithms consider...
详细信息
A large number of scheduling algorithms for large scale distributed systems have been proposed, studied and compared. In spite of this, there are few studies comparing the performance of scheduling algorithms considering at the same time the distributed system structure on which we want to schedule the tasks; the type of directed acyclic graph (DAG), in which graph nodes represent tasks and graph edges represent data transfers; and the type of tasks, for example CPU-bound vs. I/O bound. This paper proposes a method for selecting, in a dynamic manner, the most appropriate scheduling algorithm for a particular distributed system, after a previous analysis. Choosing the best known scheduling algorithm can improve performance of an application if all the aspects previously enumerated are considered. The results of this paper consist in a comparison of the scheduling algorithms performance for the following scheduling algorithms: Modified Critical Path, Cluster ready Children First, Earliest Time First, Highest Level First with Estimated Times and Hybrid Remapper Minimum Partial Completion Time Static Priority. However, the main purpose of this investigation tests is to demonstrate the usefulness of the presented scheduling approach using these results.
This paper presents a distributed solution of the synchronization of Business Intelligence (BI) Systems via networking services. The main problem addressed by the proposed project is to create a common solution that a...
详细信息
This paper presents a distributed solution of the synchronization of Business Intelligence (BI) Systems via networking services. The main problem addressed by the proposed project is to create a common solution that allows automatically redeploying of business intelligence applications among different servers located in the Internet. A case study by using the Microsoft BizTalk Server as a Business Intelligence system is presented included in a research project called PrO Processor. The research came as a necessity because of the lack of support for remote deployment of applications via Internet. Our solution overcomes this issue and presents the synchronization architecture capable of transporting, installing and starting BI applications, orchestrations and ports to any number of BI servers in the Internet.
Argumentation is one of the most active domains in Artificial Intelligence, especially in multi-agent systems. Since the initial work of Dung on abstract argumentation frameworks, many semantics have been proposed, bu...
详细信息
Argumentation is one of the most active domains in Artificial Intelligence, especially in multi-agent systems. Since the initial work of Dung on abstract argumentation frameworks, many semantics have been proposed, but for most practical cases argument acceptability is still a matter of choice. This paper introduces a formal model that aims to provide a unifying representation of argument extensions and thus offer a means for analyzing the relations between existing semantics. First, the generic model is described, then it is used for describing the most common argumentation semantics. Conclusions are drawn from the representation.
This paper presents an experimental study on the scalability of Linux Containers as a virtualization platform for evaluating Peer-to-Peer systems with real client implementations. This research identifies key features...
详细信息
ISBN:
(纸本)9781424473359
This paper presents an experimental study on the scalability of Linux Containers as a virtualization platform for evaluating Peer-to-Peer systems with real client implementations. This research identifies key features which make Linux Containers a viable solution for large-scale Peer-to-Peer virtualized infrastructures. Host resource utilization and swarm performance are evaluated for different swarm sizes, finding correlations between the virtualization solution settings and the impact on various host and peer parameters. The limits of Linux Containers are explored through experimental research, identifying directions for improving Peer-to-Peer testing in virtualized environments.
The goal of this paper is to present the advantages of robust control in comparison with classic control techniques. Pulse amplitude modulation induction heating inverter with series resonant load circuit with uncerta...
详细信息
ISBN:
(纸本)9781424467242;9781424467228
The goal of this paper is to present the advantages of robust control in comparison with classic control techniques. Pulse amplitude modulation induction heating inverter with series resonant load circuit with uncertainties is presented for heating nonferrous metals. Inverters performance with robust and PI control will be compared.
暂无评论