On CHOW: Can you use the handicapped bathroom?
BNET Business Network:
BNET
TechRepublic
ZDNet

FREE Registration is required

Overview:

This paper studies the problem of scheduling permanent jobs on un-related machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing under the Lp norm. It presents an improved upper bound for the greedy algorithm through simple analysis; this bound is also shown to be best possible within the class of deterministic online algorithms for the problem. The paper also address the question whether randomization helps on-line load balancing under Lp norms on unrelated machines; this is a challenging question which is open for more than a decade even for the L2 norm.

(Is this item miscategorized? Does it need more tags? Let us know.)

Format:PDFSize:223 KB
Date:Oct 2007
Pages:10

Top results from Load Balancing

White Paper Network Load Balancing Technical Overview
Webcast Network Load Balancing in Microsoft Windows 2000
White Paper Delivering High Availability Solutions with Red Hat Cluster Suite
White Paper Air Distribution Architecture Options for Mission Critical Facilities
White Paper Using Red Hat Enterprise Linux AS to Achieve Highly Available, Load-Balanced Clusters

» View all Load Balancing listings

Top results from Diagnostics and Analysis

White Paper Law Firm Cuts IT Costs by 90 Percent, Dismisses Server Worries with Online Services
White Paper Managing a growing threat: An Executive's Guide to Web Application Security
White Paper Lower IT Costs with Oracle Database 11g Release 2
White Paper Using Oracle In-Memory Database Cache to Accelerate the Oracle Database
White Paper TCP/IP Sleuthing--Troubleshooting TCP/IP Using Your Toolbox

» View all Diagnostics and Analysis listings

advertisement
Click Here

White Papers, Webcasts, and Resources

Featured Training Courses

Returning users: Log In Here!

Already registered on BNET, TechRepublic, or ZDNet? Simply log in.

Free Membership: Sign Up Now!

Sign up for a free membership today and get instant and unlimited access to one of the largest databases of white papers, webcasts, and casestudies anywhere. Your FREE membership allows you to:

  • Download an unlimited amount of content, including classic and current white papers, case studies, webcasts and more
  • Track content on your chosen topics of interest
  • Receive targeted email alerts when your favorite content is added
  • Save content for future reading
  • Receive our member newsletter

When you register to access this library, you allow us to share your information with companies that produce products or services featured in the library--so that such companies may contact you with information and offers regarding their products and services. This enables us to keep the library a free service. As a library registrant, you will receive a complimentary subscription to the ZDNet white paper newsletter and e-mail Must-Read News Alerts. You can unsubscribe from these at any time. By clicking the Sign up button, you indicate that you agree to our Terms and Conditions and have read and understand our Privacy Policy (updated).