Multiprocessor load balancing aims to improve performance by moving jobs from highly loaded processors to more lightly loaded processors. Some schemes allow only migration of new jobs upon arrival, while other schemes allow migration of jobs in progress. A difficulty with all these schemes, however, is that they require continuously maintaining detailed state information. In this paper we consi...

in the current engineering practices, buildings are commonly designed for an effective lifetime of 50 years. this lifetime can increase the cost of buildings with short lifetimes and can reduce the safety level of buildings with large lifetimes. in this paper, a “service-life factor” has been defined. applying this factor into the nominal values of live, earthquake, wind, and snow loads, the ef...

Large parallel machines with hundreds of thousands of processors are being built. Ensuring good load balance is critical for scaling certain classes of parallel applications on even thousands of processors. Centralized load balancing algorithms suffer from scalability problems, especially on machines with relatively small amount of memory. Fully distributed load balancing algorithms, on the oth...

A new shaped circularly polarized dielectric resonator antenna (CP DRA) is studied with branch-line coupler and log-periodic balun for the GPS application. Since the coupler and balun are located under the DRA, it does not increase the footprint of the antenna, as a result the system is very compact. Two configurations are considered in this paper. In the first configuration, an external 50Ω lo...

In the current engineering practices, buildings are commonly designed for an effective lifetime of 50 years. This lifetime can increase the cost of buildings with short lifetimes and can reduce the safety level of buildings with large lifetimes. In this paper, a “service-life factor” has been defined. Applying this factor into the nominal values of live, earthquake, wind, and snow loads, the ef...

We simplify the periodic tasks scheduling problem by making a trade off between processor load and computational complexity. A set N of periodic tasks, each characterized by its density i, contains n possibly unique values of i. We transform N through a process called quantization, in which each i 2 N is mapped onto a service level sj 2 L, where L j j 1⁄4 l n and i sj (this second condition dif...