Digital Commons Network^™

Webarc: Website Archival Using A Structured Approach, Ee Peng Lim, Maria Marissa

Research Collection School Of Computing and Information Systems

Website archival refers to the task of monitoring and storing snapshots of website(s) for future retrieval and analysis. This task is particularly important for websites that have content changing over time with older information constantly overwritten by newer one. In this paper, we propose WEBARC as a set of software tools to allow users to construct a logical structure for a website to be archived. Classifiers are trained to. determine relevant web pages and their categories, and subsequently used in website downloading. The archival schedule can be specified and executed by a scheduler. A website viewer is also developed to …

Some Topics On Deterministic Scheduling Problems, Yumei Huo

Dissertations

Sequencing and scheduling problems are motivated by allocation of limited resources over time. The goal is to find an optimal allocation where optimality is defined by some problem specific objectives.

This dissertation considers the scheduling of a set of ri tasks, with precedence constraints, on m >= 1 identical and parallel processors so as to minimize the makespan. Specifically, it considers the situation where tasks, along with their precedence constraints, are released at different times, and the scheduler has to make scheduling decisions without knowledge of future releases. Both preemptive and nonpreemptive schedules are considered. This dissertation shows that optimal …

Algorithms And Complexity Analyses For Some Combinational Optimization Problems, Hairong Zhao

Dissertations

The main focus of this dissertation is on classical combinatorial optimization problems in two important areas: scheduling and network design.

In the area of scheduling, the main interest is in problems in the master-slave model. In this model, each machine is either a master machine or a slave machine. Each job is associated with a preprocessing task, a slave task and a postprocessing task that must be executed in this order. Each slave task has a dedicated slave machine. All the preprocessing and postprocessing tasks share a single master machine or the same set of master machines. A job may …

Tosa: A Near-Optimal Scheduling Algorithm For Multi-Channel Data Broadcast, Baihua Zheng, Xia Xu, Xing Jin, Dik Lun Lee

Research Collection School Of Computing and Information Systems

Wireless broadcast is very suitable for delivering information to a large user population. In this paper, we concentrate on data allocation methods for multiple broadcast channels. To the best of our knowledge, this is the first allocation model that takes into the consideration of items' access frequencies, items' lengths. and bandwidth of different channels. We first derive the optimal average expected delay for multiple channels for the general case where data access frequencies, data sizes, and channel bandwidths can all be non-uniform. Second, we develop TOSA, a multi-channel allocation method that does not assume a uniform broadcast schedule for data …

Optimal Scheduling In A Queue With Differentiated Impatient Users, Amy Csizmar Dalal, Scott Jordan

Faculty Work

We consider a M/M/1 queue in which the average reward for servicing a job is an exponentially decaying function of the job’s sojourn time. The maximum reward and mean service times of a job are i.i.d. and chosen from arbitrary distributions. The scheduler is assumed to know the maximum reward, service rate, and age of each job. We prove that the scheduling policy that maximizes average reward serves the customer with the highest product of potential reward and service rate.

Planning And Scheduling For Large-Scaledistributed Systems, Han Yu

Electronic Theses and Dissertations

Many applications require computing resources well beyond those available on any single system. Simulations of atomic and subatomic systems with application to material science, computations related to study of natural sciences, and computer-aided design are examples of applications that can benefit from the resource-rich environment provided by a large collection of autonomous systems interconnected by high-speed networks. To transform such a collection of systems into a user's virtual machine, we have to develop new algorithms for coordination, planning, scheduling, resource discovery, and other functions that can be automated. Then we can develop societal services based upon these algorithms, which hide …