Abstract: Techniques are provided for scheduling multiple jobs on one or more cloud computing instances, which provide the ability to select a job for execution from among a plurality of jobs, and to further select a designated instance from among a plurality of cloud computing instances for executing the selected job. The job and the designated instance are each selected based on a probability distribution that a cost of executing the job on the designated instance does not exceed the budget. The probability distribution is based on several factors including a cost of prior executions of other jobs on the designated instance and a utility function that represents a value associated with a progress of each job. By scheduling select jobs on discounted cloud computing instances, the aggregate utility of the jobs can be maximized or otherwise improved for a given budget.

Abstract: Techniques are provided for scheduling multiple jobs on one or more cloud computing instances, which provide the ability to select a job for execution from among a plurality of jobs, and to further select a designated instance from among a plurality of cloud computing instances for executing the selected job. The job and the designated instance are each selected based on a probability distribution that a cost of executing the job on the designated instance does not exceed the budget. The probability distribution is based on several factors including a cost of prior executions of other jobs on the designated instance and a utility function that represents a value associated with a progress of each job. By scheduling select jobs on discounted cloud computing instances, the aggregate utility of the jobs can be maximized or otherwise improved for a given budget.

Abstract: A server/overlay network architecture and related method prevent (i.e., minimize the likelihood of) overloads from many network clients all trying to upload data files to a common destination server on the network at about the same time. Before a client transfers its (his or her) data file to the common network destination, a unique identifier (generally much smaller than the data itself) for the data of that client is generated. The unique identifier, such as a one-way hash function, is transmitted to an authenticator trusted by the common destination. The authenticator time-stamps (i.e., stores time and date) the unique identifier, digitally signs a message incorporating the unique identifier and the time-stamp and sends the message to the client who sent the unique identifier. The client then sends the data file with its time stamp to one of a plurality of upload proxy servers. The proxy server sends a message to the common destination telling it to pick up the data file when ready.

Abstract: A server/overlay network architecture and related method prevent (i.e., minimize the likelihood of) overloads from many network clients all trying to upload data files to a common destination server on the network at about the same time. Before a client transfers its (his or her) data file to the common network destination, a unique identifier (generally much smaller than the data itself) for the data of that client is generated. The unique identifier, such as a one-way hash function, is transmitted to an authenticator trusted by the common destination. The authenticator time-stamps (i.e., stores time and date) the unique identifier, digitally signs a message incorporating the unique identifier and the time-stamp and sends the message to the client who sent the unique identifier. The client then sends the data file with its time stamp to one of a plurality of upload proxy servers. The proxy server sends a message to the common destination telling it to pick up the data file when ready.

Abstract: A server/overlay network architecture and related method prevent (i.e., minimize the likelihood of) overloads from many network clients all trying to upload data files to a common destination server on the network at about the same time. Before a client transfers its (his or her) data file to the common network destination, a unique identifier (generally much smaller than the data itself) for the data of that client is generated. The unique identifier, such as a one-way hash function, is transmitted to an authenticator trusted by the common destination. The authenticator time-stamps (i.e., stores time and date) the unique identifier, digitally signs a message incorporating the unique identifier and the time-stamp and sends the message to the client who sent the unique identifier. The client then sends the data file with its time stamp to one of a plurality of upload proxy servers. The proxy server sends a message to the common destination telling it to pick up the data file when ready.