This paper presents two alternative NLP architectures to analyze massive amounts of documents, using parallel processing. The two architectures focus on different processing scenarios, namely batch-processing and streaming processing. The batch-processing scenario aims at optimizing the overall throughput of the system, i.e., minimizing the overall time spent on processing all documents. The st...

We consider the batch processing of orders where either whole or part of a single order or a specific pair of different orders may be grouped in a batch with a fixed capacity. The problem can be modelled by a graph G = (V, E), where each node v ∈ V corresponds to an order, its weight w(v) corresponds to the amount of ordered quantity and a pair of orders, say u and v may be grouped in a batch i...

Hadoop, an open-source implementation of MapReduce, has been widely used for data-intensive computing. In order to improve performance, multiple jobs operating on a common data file can be processed as a batch to share the cost of scanning the file. However, in practice, jobs often do not arrive at the same time, and batching them means longer waiting time for jobs that arrive earlier. In this ...

This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-in...

We consider two semi-online scheduling problems on a single batch (processing) machine with jobs’ nondecreasing processing times and jobs’ nonincreasing processing times, respectively. Our objective is to minimize the makespan. A batch processing machine can handle up to B jobs simultaneously. We study an unbounded model where B = ∞. The jobs that are processed together construct a batch, and a...

The most common way to identify success or failure of a job running in a batch-processing mode is by examining a completion code sent by the job to the host operating system. Yet, for a variety of reasons the completion code may inaccurately indicate a successful termination of the job. This article describes a different approach to monitoring the quality of batch processing jobs while in opera...

We consider the problem of scheduling n jobs onm identical parallel batching machines. Each job is characterized by a release time and a processing time. Each machine can process up to B (B < n ) jobs as a batch simultaneously. The processing time of a batch is equal to the largest processing time among all jobs in the batch. The objective is to minimize the maximum completion time (makespan). ...

JPL's Image Processing Laboratory (IPL) has been processing imagery using digital computers for approximately ten years. During that period, the computer capability at the IPL has developed from a single job batch oriented system with no volatile image displays to a multi-task environment accommodating both batch processing and several interactive tasks simultaneously, supporting a variety of g...