Dynamic optimization technology improves its target system on the fly according to the system status. There are some studies on microprocessors to dynamically improve performance and energy efficiency. We are investig...
详细信息
Dynamic optimization technology improves its target system on the fly according to the system status. There are some studies on microprocessors to dynamically improve performance and energy efficiency. We are investigating a software-based dynamic optimization mechanism on a multi-threaded processor to improve performance. Optimization is performed on binary codes. To optimize binary codes dynamically, profile information is required. Gathering profiles suffers overhead, and thus low overhead scheme is strongly required. This paper proposes to utilize helper threads to gather profile information with little overhead. Simulation results are also presented.
There is great potential if one could effectively harness the computation power of the plethora of low priced powerful yet under-utilized workstations connected by high-speed networks. In recent years, rapid improveme...
详细信息
There is great potential if one could effectively harness the computation power of the plethora of low priced powerful yet under-utilized workstations connected by high-speed networks. In recent years, rapid improvement of advanced hardware and progress in networking technology is also making PC clusters a competitive platform for parallelcomputing. Traditionally, cluster programming has been performed with message passing libraries. As the performance, especially the latency, of the communication network improves, the expectation to support a shared-memory programming model on clusters is reviving. In this paper, we put forward a system having both a distributed shared memory cluster and heterogeneous computers as system nodes which can support automatic distribution, migration, communication and coordination of multithreaded applications on a heterogeneous platform. This will be a creative application-driven experimental infrastructure that will explore challenging problems in distribution management and control, in middleware integration and deployment, in software architecture and software engineering.
In the majority of structured peer-to-peer overlay networks a graph with a desirable topology is constructed. In most cases, the graph is maintained by a periodic activity performed by each node in the graph to preser...
详细信息
In the majority of structured peer-to-peer overlay networks a graph with a desirable topology is constructed. In most cases, the graph is maintained by a periodic activity performed by each node in the graph to preserve the desirable structure in face of the continuous change of the set of nodes. The interaction of the autonomous periodic activities of the nodes renders the performance analysis of such systems complex and simulation of scales of interest can be prohibitive. Physicists, however, are accustomed to dealing with scale by characterizing a system using intensive variables, i.e. variables that are size independent. The approach has proved its usefulness when applied to satisfiability theory. This work is the first attempt to apply it in the area of distributedsystems. The contribution of this paper is two-fold. First, we describe a methodology to be used for analyzing the performance of large scale distributedsystems. Second, we show how we applied the methodology to find an intensive variable that describe the characteristic behavior of the Chord overlay network, namely, the ratio of the magnitude of perturbation of the network (joins/failures) to the magnitude of periodic stabilization of the network.
distributedsystems form the underlying architecture of consumer's Ambient Intelligence at 'home' and 'away'. Besides the bare performance, other use values are of relevance. In case of consumer co...
详细信息
distributedsystems form the underlying architecture of consumer's Ambient Intelligence at 'home' and 'away'. Besides the bare performance, other use values are of relevance. In case of consumer content storage the data availability and the underlying effort and care have to be considered, with consumer's lifetime as range of analysis. A new method is presented, which uses Fuzzy logic for semi-quantification, being the delivery of qualitative results by certain quantification means. Technology projections on storage capacity and cost are applied. Some results are presented as examples: Removable media may lead to high human effort & care among 'living archive' solutions. Effective consumer storage can be realized by combining a 'centralized' home archive with a set of distributed archival-data-proxy's, the latter with a certain level of 'concentration' by 'specialization' according to occasions of use. An important aspect will be the trade-off between central home server solutions and personalized storage services in the Internet.
Grid computing aims at providing computing resources much in the same way as electricity is provided in a power grid. A grid is a large collection of computing resources that are managed by a resource manager to make ...
详细信息
Grid computing aims at providing computing resources much in the same way as electricity is provided in a power grid. A grid is a large collection of computing resources that are managed by a resource manager to make it appear like a single powerful computing resource. The technology is still in its developing stages and has not yet matured to the point that a sequential task submitted to the grid can run on more than a single machine simultaneously. Automatic parallelization techniques have been proposed, that can parallelize sequential tasks into multiple threads that can be executed simultaneously with some communication between each other. Nevertheless, actual tools that apply these methods to computational grid, are still rare. In this paper, we discuss certain program parallelization techniques and propose a transformation to parallelize sequential programs for a grid. We discuss our tool, which is based on the SUIF. Our tool extends parallelization strategy of SUIF to convert sequential code into its semantic equivalent parallel code that can run on a grid.
With the rapidly growing capability of computer architectures their complexity grows as well. More and more parallelism is necessary to provide the needed computing power. Moreover, systems must adapt to changing envi...
详细信息
With the rapidly growing capability of computer architectures their complexity grows as well. More and more parallelism is necessary to provide the needed computing power. Moreover, systems must adapt to changing environments and cope with a breakdown of components. One approach is to incorporate organic features into computer systems. Organic computers [14] are characterized by self-x properties like self-configuring, self-optimizing, self-healing, and self-protecting. To make a cluster computer behave "organic", it should possess (among other important aspects) some kind of self-healing feature, which detects and deactivates defective components. If a node fails, all data stored in its local memory is lost. Therefore deactivation alone will usually not suffice, as in computer clusters data is often stored in a decentralized way. Concepts have to be developed to store data redundantly and to recover the data in case of a failure. In this paper the concept and features of the implemented prototype of the Self Distributing Virtual Machine (SDVM) is presented. Self-healing will be discussed as one aspect of the functionality of the SDVM.
This paper describes a new Grid application which performs analysis of log files conforming to several different standard formats. In order to exploit the potential execution parallelism of the Grid, we designed and d...
详细信息
This paper describes a new Grid application which performs analysis of log files conforming to several different standard formats. In order to exploit the potential execution parallelism of the Grid, we designed and developed a software architecture which splits log files into smaller fragments which are then analyzed independently, possibly in parallel, using computing resources available in a Grid environment. We present the distributed architecture of our Grid log analyzer and describe Jet-Lag, our first Java implementation. We then propose an experimental setting to test Jet-Lag functionality and performance on a Data-Grid test-bed. First experimental results show that Grid log analysis with the proposed software architecture is feasible and effective. Performance, as expected for a first Java prototype implementation, is not yet optimal, but main bottlenecks have been identified. A considerable amount of experimental data has been collected that will provide reference material for further investigation.
This paper introduces SCCB1 cluster system in which SCC PCI boards are implemented. SCCB cluster is built using PCs(32nodes) for processor, and two networks. SCC PCI boards allow to fast barrier synchronization mechan...
详细信息
This paper introduces SCCB1 cluster system in which SCC PCI boards are implemented. SCCB cluster is built using PCs(32nodes) for processor, and two networks. SCC PCI boards allow to fast barrier synchronization mechanism and *** order to perform fast synchronization, each SCC board is connected by a new type of network, and checks completion of barrier by hardware. PGCCS allows us to measure execution times accurately on the Beowulf clusters. In performance evaluation, SCC board plugged into 32-nodes PC cluster achieves barrier latency of 3.2 μ8. Time difference errors of PGCCS were smaller (1/100) than that of a conventional method using MPLBarrier.
distributed Denial of Services DDoS, attacks has become one of the biggest threats for resources over Internet. Purpose of these attacks is to make servers deny from providing services to legitimate users. These attac...
详细信息
distributed Denial of Services DDoS, attacks has become one of the biggest threats for resources over Internet. Purpose of these attacks is to make servers deny from providing services to legitimate users. These attacks are also used for occupying media bandwidth. Currently intrusion detection systems can just detect the attacks but cannot prevent / track the location of intruders. Some schemes also prevent the attacks by simply discarding attack packets, which saves victim from attack, but still network bandwidth is wasted. In our opinion, DDoS requires a distributed solution to save wastage of resources. The paper, presents a system that helps us not only in detecting such attacks but also helps in tracing and blocking (to save the bandwidth as well) the multiple intruders using Intelligent Software Agents. The system gives dynamic response and can be integrated with the existing network defense systems without disturbing existing Internet model. We have implemented an agent based networking monitoring system in this regard.
This paper presents a distributed-computing technique based on a particle swarm optimization (PSO) algorithm for the parameter extraction of photovoltaic modules. The procedure exploits interlacing of the experimental...
详细信息
This paper presents a distributed-computing technique based on a particle swarm optimization (PSO) algorithm for the parameter extraction of photovoltaic modules. The procedure exploits interlacing of the experimental data in order to decrease the computational load, and parallelcomputing of different and independent runs to collect a large amount of data in order to save computational time. The statistical instability typical of numerical data fitting algorithms can thus be efficiently controlled.
暂无评论