Michael A. Palis

Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

2005

The Granularity Metric for Fine-Grain Real-Time Scheduling.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2005

2004

Competitive Algorithms for Fine-Grain Real-Time Scheduling.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE Real-Time Systems Symposium (RTSS 2004), 2004

2003

On the Competitiveness of Online Real-Time Scheduling with Rate of Progress Guarantees.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2003

2002

Online Real-Time Job Scheduling with Rate of Progress Guarantees.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Parallel Architectures, 2002

2001

Special Issue on Parallel and Distributed Computing.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2001

2000

Online real-time preemptive scheduling of jobs with deadlines.

[BibT_eX]

[DOI]

Bhaskar DasGupta

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999

Provably Good Algorithms for Transmission Scheduling in WDM Optical Networks.

[BibT_eX]

[DOI]

Bhaskar DasGupta

J. Parallel Distributed Comput., 1999

1998

On the Effectiveness of Compiler-Time Scheduling Approaches for Distributed Memory Multiprocessor.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 1998

Editor's Foreword.

[BibT_eX]

D. Frank Hsu

Int. J. Found. Comput. Sci., 1998

A New Heuristic for Scheduling Parallel Programs on Multiprocessor.

[BibT_eX]

[DOI]

Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques, 1998

1997

Performance Analysis of Task Clustering Heuristics for Scheduling Static Dags on Multiprocessor System*.

[BibT_eX]

[DOI]

Parallel Algorithms Appl., 1997

CASS: an efficient task management system for distributed memory architectures.

[BibT_eX]

[DOI]

Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

A Comparison of General Approaches to Multiprocessor Scheduling.

[BibT_eX]

[DOI]

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

1996

Task Clustering and Scheduling for Distributed Memory Parallel Architectures.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1996

1995

Online Scheduling of Dynamic Trees.

[BibT_eX]

[DOI]

Sanguthevar Rajasekaran

Parallel Process. Lett., 1995

Pumping Lemmas for the Control Language Hierarchy.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1995

Backtracking and Branch-and-Bound on Mesh-Connected Computers with Reconfigurable Buses.

[BibT_eX]

Proceedings of the Seventh IASTED/ISMM International Conference on Parallel and Distributed Computing and Systems, 1995

1994

Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks.

[BibT_eX]

[DOI]

Sanguthevar Rajasekaran

J. Parallel Distributed Comput., 1994

A greedy task clustering heuristic that is provably good.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Parallel Architectures, 1994

1992

Upper Bounds on Recognition of a Hierarchy of Non-Context-Free Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Parallel parsing of Tree Adjoining Grammars on the Connection Machine.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1992

An NC algorithm for recognizing tree adjoining languages.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1992

1991

Emulation of a PRAM on Leveled Networks.

[BibT_eX]

Sanguthevar Rajasekaran

Proceedings of the International Conference on Parallel Processing, 1991

1990

Systolic algorithms for some scheduling and graph problems.

[BibT_eX]

[DOI]

J. VLSI Signal Process., 1990

An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages.

[BibT_eX]

[DOI]

SIAM J. Comput., 1990

An efficient all-parses systolic algorithm for general context-free parsing.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1990

Parallel TAG Parsing on the Connection Machine.

[BibT_eX]

[DOI]

Proceedings of the First International Workshop on Tree Adjoining Grammar and Related Frameworks, 1990

1989

Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATMs and Space-Bounded TMs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1989

Sublinear Parallel Time Recognition of Tree Adjoining Languages.

[BibT_eX]

Proceedings of the International Conference on Parallel Processing, 1989

1988

Two-Dimensional Iterative Arrays: Characterizations and Applications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM's and Space-Bounded TM's.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987

VLSI algorithms for solving recurrence equations and applications.

[BibT_eX]

[DOI]

IEEE Trans. Acoust. Speech Signal Process., 1987

Parallel Parsing on a One-Way Array of Finite-State Machines.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1987

On Efficient Simulations of Systolic Arrays of Random-Access Machines.

[BibT_eX]

[DOI]

SIAM J. Comput., 1987

1986

On Pebble Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

Designing Systolic Algorithms Using Sequential Machines.

[BibT_eX]

[DOI]

Sam M. Kim

IEEE Trans. Computers, 1986

1985

Fast Parallel Language Recognition by Cellular Automata.

[BibT_eX]

[DOI]

Sam M. Kim

Theor. Comput. Sci., 1985

On Efficient Recognition of Transductions and Relations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

Some results concerning linear iterative (systolic) arrays.

[BibT_eX]

[DOI]