Parallel Job Scheduling with Overhead: A Benchmark Study (2009)
Richard A. Dutton, Weizhen Mao, Jie Chen, William Watson
We study parallel job scheduling, where each job may be scheduled on any number of available processors in a given parallel system. We propose a mathematical model to estimate a job’s execution...
ONLINE SCHEDULING OF MALLEABLE PARALLEL JOBS (2009)
Richard A. Dutton, Weizhen Mao
In this paper, we study a parallel job scheduling model which takes into account both computation time and the overhead from communication between processors. Assuming that a job Jj has a processing...
Bo Sheng, Chiu C. Tan, Qun Li, Weizhen Mao
As RFID tags are increasingly attached to everyday items, it quickly becomes impractical to collect data from every tag in order to extract useful information. In this paper, we consider the problem...
ABSTRACT Outlier Detection in Sensor Networks (2009)
Outlier detection has many important applications in sensor networks, e.g., abnormal event detection, animal behavior change, etc. It is a difficult problem since global information about data...
Parallel Multidisciplinary Design Optimization (2008)
Abstract In this paper, we define a parallel version of the multidisciplinary design optimization problem, where parallel processors are available to execute computation modules with input/output...
Improved Parallel Job Scheduling with Overhead (2008)
Jessen T. Havill, Weizhen Mao, Vesselin Dimitrov
We consider a parallel job scheduling model that incorporates both computation time and communication overhead. For any job J j with length p j, if k j processors are assigned to execute the job,...
Efficient Subtorus Processor Allocation in a Multi-Dimensional Torus (2008)
Processor allocation in a mesh or torus connected multicomputer system with up to three dimensions is a hard problem that has received some research attention in the past decade. With the recent...
ONE-TO-ALL PERSONALIZED COMMUNICATION IN TORUS NETWORKS (2008)
Given a multicomputer system of parallel processors connected in a torus network, the one-to-all personalized communication is to send from the root processor unique data to each of the other...
ETAQA-MG1: An Ecient Technique for the Analysis of M/G/1-type processes by Aggregation (2007)
Gianfranco Ciardo, Weizhen Mao, Alma Riska, Evgenia Smirni
We extend the ETAQA approach, initially proposed for the ecient numerical solution of a class of quasi birth-death processes, to the more complex case of M/G/1-type Markov processes. The new...
Outlier Detection in Sensor Networks (2007)
Bo Sheng, Qun Li, Weizhen Mao, Wen Jin
Outlier detection has many important applications in sensor networks, e.g., abnormal event detection, animal behavior change, etc. It is a difficult problem since global information about data...
On Bottleneck Partitioning k-ary n-Cubes (2006)
Graph partitioning is a topic of extensive interest, with applications to parallel processing. In this context graph nodes typically represent computation, and edges represent communication. One...
Automated Parallelization of Timed Petri-Net Simulations (2006)
Timed Petri-nets are used to model numerous types of large complex systems, especially computer architectures and communication networks. While formal analysis of such models is sometimes possible,...
a class of M/G/1-type processes by aggregation (2005)
Gianfranco Ciardo, Weizhen Mao, Alma Riska, Evgenia Smirni
An efficient technique for the analysis of
Gianfranco Ciardo, Weizhen Mao, Alma Riska, Evgenia Smirni
We extend the Etaqa approach, initially proposed for the efficient numerical solution of a class of quasi-birth–death processes, to a more complex class of M/G/1-type Markov processes where...
III. On-line algorithms for a parallel job scheduling problem (1999)
2 for the dual-processor case. We present simulationresults on the performance of an algorithm for the multiprocessor case. Keywords: Parallel job scheduling, on-line algorithm,competitive ratio,...
Greedy Online Algorithms for Routing Permanent Virtual Circuits (1999)
We analyze the competitive ratio of two greedy online algorithms for routing permanent virtual circuits in a network with arbitrary topology and uniform capacity links. We show that the competitive...
Isomorphic Routing on a Toroidal Mesh. (1998)
We study a routing problem that arises on SIMD parallel architectures whose communication network forms a toroidal mesh. We assume there exists a set of k message descriptors (xi, yi) , where (xi,...
On K-ARY N-CUBES: Theory and Applications. (1998)
Many parallel processing networks can be viewed as graphs called k-ary n-cubes, whose special cases include rings, hypercubes and toruses. In this paper, combinatorial properties of k-ary n-cubes are...
W.Mao, On-line algorithms for hybrid flow shop scheduling (1998)
We study a hybrid ow shop scheduling problem, in which the execution of each job must go through multiple stages in one specic order and at each stage there are parallel machines available to process...
A Lower Bound For On-Line File Transfer Routing And Scheduling (1997)
Jessen Havill Weizhen, Weizhen Mao, Rahul Simha
In this paper, we study the On-Line File Transfer Routing and Scheduling problem. Given a sequence of file transfer requests and a graph that represents a network, the problem is to determine both a...
On bottleneck partitioning of k-ary n-cubes (1996)
David M. Nicol, Weizhen Mao, David M. Nicol, Wcizhcn Mao
(/raph partitioning is a topic of extensive interest, with applications to parallel processing. In this context graph nodes typically represent computation, and edges represent communication. One...
Automated Parallelization of Timed Petri-Net Simulations (1995)
Timed Petri-nets are used to model numerous types of large complex systems, especially computer architectures and communication networks. While formal analysis of such models is sometimes possible,...
On-line Algorithms for a Single Machine Scheduling Problem (1995)
Weizhen Mao, Rex K. Kincaid, Adam Rifkin
An increasingly significant branch of computer science is the study of online algorithms. In this paper, we apply the theory of on-line algorithms to job scheduling. In particular, we study the...
Routing and scheduling file transfers in packet-switched networks (1994)
Data traffic in networks has always been dominated by file transfers, an observation that has motivated previous work in scheduling file transfers. While these previous research contributions address...
Routing and Scheduling File Transfers in Packet-Switched Networks (1994)
Data traffic in networks has always been dominated by file transfers, an observation that has motivated previous work in scheduling file transfers. While these previous research contributions address...
Routing and Scheduling File Transfers in Packet-Switched Networks - Appendix (1994)
is a nonpreemptive multiprocessor schedule with makespan B if and only if there is a file transfer schedule for the instance defined above with makespan B. Since the reduction can be performed in...
On Bottleneck Partitioning of k-ary n-cubes (1994)
David Nicol Weizhen, David M. Nicol, Weizhen Mao
Graph partitioning is a topic of extensive interest, with applications to parallel processing. In this context graph nodes typically represent computation, and edges represent communication.