This paper deals with semi-online scheduling on two parallel batch processing machines with jobs’ nondecreasing processing times. Our objective is to minimize the makespan. A batch processing machine can handle up to B jobs simultaneously. We study unbounded model which means that B is sufficiently large. The jobs that are processed together construct a batch, and all jobs in a batch start and ...

front of the batch processor, where they wait to be processed. The batch processor has a finite capacity Q, and the processing time is independent of the number of jobs loaded into the batch processor. In certain manufacturing systems (including semiconductor wafer fabrication), a processing time window exists from the time the job exits the feeder processor till the time it enters the batch pr...

A batch processing machine can simultaneously process several jobs forming a batch. This paper considers the problem of scheduling jobs with non-identical capacity requirements, on a single-batch processing machine of a given capacity, to minimize the makespan. The processing time of a batch is equal to the largest processing time of any job in the batch. We present some dominance properties fo...

Title of dissertation: Pig Squeal: Bridging Batch and Stream Processing Using Incremental Updates James Holmes Lampton, Jr., Doctor of Philosophy, 2015 Dissertation directed by: Professor Ashok Agrawala Department of Computer Science As developers shift from batch MapReduce to stream processing for better latency, they are faced with the dilemma of changing tools and maintaining multiple code b...

Aggregation in traditional database systems is performed in batch mode: a query is submitted, the system processes a large volume of data over a long period of time, and an accurate answer is returned. Batch mode processing has long been unacceptable to users. In this paper we describe the need for online aggregation processing, in which aggregation operators provide ongoing feedback, and are c...

We consider the problem of minimizing the total late work ( n ∑ j=1 V j) on an unbounded batch processing machine, where V j = min{Tj, p j} and Tj = max{C j−d j,0}. The batch processing machine can process up to B (B≥ n) jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time, respectively. For a batch of jobs, the proc...

Low rank matrix recovery has shown its importance as a theoretic foundation in many areas of information processing. Its solutions are usually obtained in batch mode that requires to load all the data into memory during processing, and thus are hardly applicable on large scale data. Moreover, a fraction of data may be severely contaminated by outliers, which makes accurate recovery significantl...

In the last few years, hyperspectral imaging technique has had a bright future for application on nondestructive detection of agricultural products. However, in experiment, there are usually dozens or even hundreds of hyperspectral images. It needs to spend lots of time in preprocessing all the hyperspectral data. Software ENVI is a kind of image processing software, although the users can defi...

Analysis of big data has become an important problem for many business and scientific applications, among which clustering and visualizing clusters in big data raise some unique challenges. This demonstration presents the CloudVista prototype system to address the problems with big data caused by using existing data reduction approaches. It promotes a whole-big-data visualization approach that ...

Big Data Management has become a critical task in many application systems, which usually rely on heavyweight batch processes to process large amounts of data. However, batch architectures are not an adequate choice for the design of real-time systems, where expected response times are several orders of magnitude underneath. This paper outlines the foundations for defining an architecture able ...