2005 |
35 | EE | Michael A. Palis:
The Granularity Metric for Fine-Grain Real-Time Scheduling.
IEEE Trans. Computers 54(12): 1572-1583 (2005) |
2004 |
34 | EE | Michael A. Palis:
Competitive Algorithms for Fine-Grain Real-Time Scheduling.
RTSS 2004: 129-138 |
2003 |
33 | EE | Michael A. Palis:
On the Competitiveness of Online Real-Time Scheduling with Rate of Progress Guarantees.
Int. J. Found. Comput. Sci. 14(3): 359-370 (2003) |
2002 |
32 | EE | Michael A. Palis:
Online Real-Time Job Scheduling with Rate of Progress Guarantees.
ISPAN 2002: 65-70 |
2001 |
31 | | Michael A. Palis:
Special Issue on Parallel and Distributed Computing.
Int. J. Found. Comput. Sci. 12(3): 245-247 (2001) |
2000 |
30 | EE | Bhaskar DasGupta,
Michael A. Palis:
Online real-time preemptive scheduling of jobs with deadlines.
APPROX 2000: 96-107 |
1999 |
29 | | Bhaskar DasGupta,
Michael A. Palis:
Provably Good Algorithms for Transmission Scheduling in WDM Optical Networks.
J. Parallel Distrib. Comput. 57(3): 345-357 (1999) |
1998 |
28 | EE | Jing-Chiou Liou,
Michael A. Palis:
A New Heuristic for Scheduling Parallel Programs on Multiprocessor.
IEEE PACT 1998: 358-365 |
27 | | D. Frank Hsu,
Michael A. Palis,
David S. L. Wei:
Editor's Foreword.
Int. J. Found. Comput. Sci. 9(1): 1- (1998) |
26 | EE | Jing-Chiou Liou,
Michael A. Palis:
On the Effectiveness of Compiler-Time Scheduling Approaches for Distributed Memory Multiprocessor.
J. Inf. Sci. Eng. 14(1): 7-26 (1998) |
1997 |
25 | EE | Jing-Chiou Liou,
Michael A. Palis:
A Comparison of General Approaches to Multiprocessor Scheduling.
IPPS 1997: 152-156 |
24 | EE | Jing-Chiou Liou,
Michael A. Palis:
CASS: an efficient task management system for distributed memory architectures.
ISPAN 1997: 289-295 |
23 | EE | Jing-Chiou Liou,
Michael A. Palis,
David S. L. Wei:
Performance Analysis of Task Clustering Heuristics for Scheduling Static Dags on Multiprocessor System*.
Parallel Algorithms Appl. 12(1-3): 185-203 (1997) |
1996 |
22 | EE | Michael A. Palis,
Jing-Chiou Liou,
David S. L. Wei:
Task Clustering and Scheduling for Distributed Memory Parallel Architectures.
IEEE Trans. Parallel Distrib. Syst. 7(1): 46-55 (1996) |
1995 |
21 | | Michael A. Palis,
David S. L. Wei:
Backtracking and Branch-and-Bound on Mesh-Connected Computers with Reconfigurable Buses.
Parallel and Distributed Computing and Systems 1995: 243-247 |
20 | | Michael A. Palis,
Sunil M. Shende:
Pumping Lemmas for the Control Language Hierarchy.
Mathematical Systems Theory 28(3): 199-213 (1995) |
19 | | Michael A. Palis,
Jing-Chiou Liou,
Sanguthevar Rajasekaran,
Sunil M. Shende,
David S. L. Wei:
Online Scheduling of Dynamic Trees.
Parallel Processing Letters 5: 635-646 (1995) |
1994 |
18 | | Michael A. Palis,
Sanguthevar Rajasekaran,
David S. L. Wei:
Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks.
J. Parallel Distrib. Comput. 20(2): 145-157 (1994) |
1992 |
17 | | Michael A. Palis,
Sunil M. Shende:
Upper Bounds on Recognition of a Hierarchy of Non-Context-Free Languages.
Theor. Comput. Sci. 98(2): 289-319 (1992) |
1991 |
16 | | Michael A. Palis,
Sanguthevar Rajasekaran,
David S. L. Wei:
Emulation of a PRAM on Leveled Networks.
ICPP (1) 1991: 418-421 |
1990 |
15 | | Michael A. Palis,
Sunil M. Shende,
David S. L. Wei:
An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages.
SIAM J. Comput. 19(1): 1-31 (1990) |
14 | EE | Oscar H. Ibarra,
Tao Jiang,
Jik H. Chang,
Michael A. Palis:
Systolic algorithms for some scheduling and graph problems.
VLSI Signal Processing 1(4): 307-320 (1990) |
1989 |
13 | | Michael A. Palis,
Sunil M. Shende:
Sublinear Parallel Time Recognition of Tree Adjoining Languages.
ICPP (3) 1989: 202-205 |
12 | | Oscar H. Ibarra,
Michael A. Palis:
An Efficient All-Parses Systolic Algorithm for General Context-Free Parsing.
WADS 1989: 403-419 |
11 | | Jik H. Chang,
Oscar H. Ibarra,
Michael A. Palis:
Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATMs and Space-Bounded TMs.
Theor. Comput. Sci. 68(1): 19-36 (1989) |
1988 |
10 | | Jik H. Chang,
Oscar H. Ibarra,
Michael A. Palis:
Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM's and Space-Bounded TM's.
ICALP 1988: 119-132 |
9 | | Oscar H. Ibarra,
Michael A. Palis:
Two-Dimensional Iterative Arrays: Characterizations and Applications.
Theor. Comput. Sci. 57: 47-86 (1988) |
1987 |
8 | | Jik H. Chang,
Oscar H. Ibarra,
Michael A. Palis:
Parallel Parsing on a One-Way Array of Finite-State Machines.
IEEE Trans. Computers 36(1): 64-75 (1987) |
7 | | Oscar H. Ibarra,
Michael A. Palis:
On Efficient Simulations of Systolic Arrays of Random-Access Machines.
SIAM J. Comput. 16(2): 367-377 (1987) |
1986 |
6 | | Jik H. Chang,
Oscar H. Ibarra,
Michael A. Palis:
Parallel Parsing on a One-Way Array of Finite-State Machines.
ICPP 1986: 887-894 |
5 | | Oscar H. Ibarra,
Sam M. Kim,
Michael A. Palis:
Designing Systolic Algorithms Using Sequential Machines.
IEEE Trans. Computers 35(6): 531-542 (1986) |
4 | | Jik H. Chang,
Oscar H. Ibarra,
Michael A. Palis,
Bala Ravikumar:
On Pebble Automata.
Theor. Comput. Sci. 44: 111-121 (1986) |
1985 |
3 | | Oscar H. Ibarra,
Michael A. Palis,
Jik H. Chang:
On Efficient Recognition of Transductions and Relations.
Theor. Comput. Sci. 39: 89-106 (1985) |
2 | | Oscar H. Ibarra,
Michael A. Palis,
Sam M. Kim:
Fast Parallel Language Recognition by Cellular Automata.
Theor. Comput. Sci. 41: 231-246 (1985) |
1984 |
1 | | Oscar H. Ibarra,
Michael A. Palis,
Sam M. Kim:
Designing Systolic Algorithms Using Sequential Machines
FOCS 1984: 46-55 |