Utilizing a collection of workstations and supercomputers in a metacomputing environment does not only o er an enormous amount of computing power, but also raises new problems. The true potential of WAN-based distributed computing can only be exploited if the application-to-architecture mapping re ects the di erent processor speeds, network performances and the application's communication chara...

In this paper, a deterministic algorithm for dynamically embedding binary trees into hypercubes is presented. Because of a known lower bound, any such algorithm must use either randomization or migration, i.e., remapping of tree vertices, to obtain an embedding of trees into hypercubes with small dilation, load, and expansion simultaneously. Using migration of previously mapped tree vertices, t...

As challenges to child well-being through economic disadvantage, family disruption, and migration or displacement escalate world wide, the need for cross-culturally robust understanding of childhood adversity proportionately increases. Toward this end, developmental risk was assessed in four contrasting groups of 107 Nepali children ages 10-14 years that represent distinctive, common conditions...

In this paper, a deterministic algorithm for dynamically embedding binary trees into hypercubes is presented. Because of a known lower bound, any such algorithm must use either randomization or migration, i.e., remapping of tree vertices, to obtain an embedding of trees into hypercubes with small dilation, load, and expansion simultaneously. Using migration of previously mapped tree vertices, t...

Multicore architectures are employed more and more in todays system. A main task of current operating systems is to equalize the load of each CPU’s core, it is accomplished by the migration policy of an operating system. Nevertheless, the migration policy of an operating system is mostly entangled in the kernel. Thus, migration policies of guest kernels running within virtual machines may contr...

We present an analysis of the costs and benefits of load sharing of parallel jobs in the computational grid. We begin with a workload generation model that captures the essential properties of parallel jobs and use it as input to a grid simulation model. Our experiments are performed for both homogeneous and heterogeneous grids. We measured average job slowdown with respect to both local and re...

In order to solve the problems of ill-balanced task allocation, long response time, low throughput rate and poor performance when the cluster system is assigning tasks, we introduce the concept of entropy in thermodynamics into load balancing algorithms. This paper proposes a new load balancing algorithm for homogeneous clusters based on the Maximum Entropy Method (MEM). By calculating the entr...

In cloud computing the major problem area is fault tolerance. When many clients request the server simultaneously, server is overloaded which causes fault. In our approach the load balancing technique is used to avoid fault. There are various fault tolerance techniques in existing cloud computing. They are self healing, job migration, static load balancing and replication. There are some drawba...

Companies use Extract-Transform-Load (Etl) tools to save time and costs when developing and maintaining data migration tasks. Etl tools allow the definition of often complex processes to extract, transform, and load heterogeneous data into a data warehouse or to perform other data migration tasks. In larger organizations many Etl processes of different data integration and warehouse projects ac...

Scalability and availability are key features of parallel database systems. To realize scalability, many dynamic load-balancing methods with data placement and parallel index structures on sharednothing parallel infrastructure have been proposed. Data migration with range-partitioned placement using a parallel Btree is one solution. The combination of range partitioning and chained declustered ...