grigoria@zeno.rutgers.EDU (Mike Grigoriadis) (12/10/90)
Professor C. L. Liu of the Computer Science Dept, University of
Illinois at Urbana-Champaign, will give three talks in the New
York Metropolitan Area next week. You are cordially invited to attend
any and all of them. Titles, abstracts, time and location of these
talks follow.
--------------------------------------------------
A Special Lecture Co-Sponsored by
The New York Academy of Sciences, Computer & Information Sciences Section
&
The City University of New York Seminar in Combinatorial Computing
SCHEDULING PROBLEMS IN REAL-TIME SYSTEMS
C. L. Liu
In a hard-real-time computing environment, tasks are specified by their
arrival times, execution times, and deadlines. Execution of a task
cannot commence before its arrival and must be completed at or prior to
its deadline. Examples of applications supported by real-time computing
systems include intelligent manufacturing, avionics and navigation, air
traffic control, robotics, and autonomous vehicular control.
There are many problems concerning task scheduling for real-time
computing systems. The tasks can be periodic or sporadic. The
initiation times of the tasks can all be equal or arbitrary. The
computing system can be a uni-processor or a multi-processor system. In
this talk, we shall present results for some of these scheduling
problems.
Time: Lecture at 8:00 p.m., Monday, December 10, 1990
Place: Room 207, CUNY Graduate Center, 33 West 42nd Street, NYC
Reception: Wine and cheese reception, followed by a self-serve dinner.
Meet at the cafeteria, 18th floor, 6:30 p.m.
Further info: Contact Gary Bloom (GSBCC@CUNYVM.CUNY.EDU) or
Mike Grigoriadis (grigoriadis@cs.rutgers.edu)
-------------------------------------------------------
DISTINGUISHED LECTURE SERIES AT FORDHAM UNIVERSITY
ALGORITHMIC ASPECTS OF COMPUTER AIDED DESIGN OF INTEGRATED CIRCUITS
C. L. Liu
Many problems encountered in the area of computer-aided design of
large scale integrated circuits are known to be ``computationally
difficult.'' Algorithmic methodologies for solving some of these
problems will be discussed. In particular, we shall demonstrate how
problems in the physical design area such as floorplan design, module
orientation, pin assignment, and channel routing are handled.
Time: December 11, 1990 at 3:30 p.m.
Place: Fordham University, Rose Hill Campus
Mc Ginley Center - Music Room
Directions: From NYC - At 66th Street (Lincoln Center Campus) - Take
the FU RAM VAN, which leaves that campus at 12:30; 1:30; 2:30
p.m.
The trip takes about 35-40 minutes.
OR
METRO NORTH - Take train to the Fordham Road Station. From
that
point Mc Ginley Center is a short walk.
OR
By car: GW Bridge to Major Deegan Expressway North,
exit at Van Cortland Park Exit. Take right, continue
through light, uphill onto the Mosholu Extension,
go as far as you can go, make right at last light;
Proceed for two more lights to reach Fordham Univ.
Botanical Gardens will be on your left and Fordham
University on your right.
Further info: Call Computer and Inf. Science Department: (212) 579-2589.
---------------------------------------
JOINT COLLOQUIUM
CENTER FOR DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
&
DEPARTMENT OF COMPUTER SCIENCE, RUTGERS UNIVERSITY
MATCHING, (0,1)-MATRICES AND FAULT COVERAGE
C. L. Liu
The theory of matching and related results for (0,1)-matrices
are applied to solve several fault coverage problems for
rectangular memory arrays. Extension to fault coverage problems
for a more general class of reconfigurable architectures will
also be discussed.
Time: Thursday, December 13, 1990, 3:00-4:00 p.m.
Place: Hill Center for Mathematical Sciences - Room 705, 7th Floor
Busch Campus- Rutgers University. (Off Route 18 in Piscataway:
take Metlar's Lane to Brett Road, proceed to its end to parking
lot.)
Coffee: 2:30 p.m., Room 705, Hill Center.
Further info: M. D. Grigoriadis (grigoriadis@cs.rutgers.edu 201-932-2898)
-------------------------------------------------------