Conference on Theoretical and
Applied Computer
Science (TACS'10)
Oklahoma State University
Stillwater, OK
November 5, 2010
www.cs.okstate.edu/tacs10
Call for Papers • Committee • Submissions • Venue • Proceedings • Program • Pictures • Contact Us
Professor
Sohum Sohoni is an Assistant Professor in the School of
Electrical and Computer Engineering at Oklahoma State University. His
primary field of research is the cache memory performance of
memory-intensive applications. Besides mainstream cache memory systems,
his research spans embedded systems, multimedia applications, and
secure architectures. He is a popular instructor, and recently received
the CEAT Halliburton Excellent Young Teacher Award (2009) and the
Regents Distinguished Teaching Award (2010).
Title for
talk: OS Interaction with Cache Memories
Slides: Microsoft PowerPoint
and PDF
Abstract: The
design
of
cache
hierarchies
and
various
policies
associated
with
the
operation
of
cache
memories can be severely impacted by the processes expected to
run on
the hardware, and the scheduling decisions of the operating system.
This talk
describes some of these interactions between OS and cache design, and
presents
some results on re-fetching data evicted by processes running in a
multiprogrammed system with frequent context switches.
Time: 11.00 - 11.30 am
Professor
Michel Toulouse is a Visiting Associate Professor in the
Computer Science Department at Oklahoma State University. His research
interests include local search, meta-heuristics (tabu search, simulated
annealing, genetic
algorithms, others), parallel search heuristics. The originality of his
work is in a multi-thread exploration of the
search space based on techniques such as cooperative search and
multilevel search.
Title for
talk: A Hybrid Genetic Algorithm for the Periodic Vehicle
Routing Problem with Time Windows
Slides: Microsoft
PowerPoint and PDF
Abstract:
The periodic vehicle routing problem with time
windows (PVRPTW) is a
generalization of the VRPTW where each customer can be served several
times over the given planning period. PVRPTW and VRPTW include VRP as
sub-problem, VRP is combinatorial NP-Hard. A heuristic solution for
PVRPTW is
proposed. The heuristic is a hybrid genetic algorithm which combines
effective crossover operators with advanced repair strategies to solve
this problem. Time permitting, a cooperative search parallelization of
this algorithm will be introduced and issues related to the convergence
analysis of cooperative search algorithms will be discussed.
Time: 2.00 - 2.30 pm
Computer Science Department, Oklahoma State
University
Established - 1969
219 MSCS, Computer Science Department, Oklahoma State
University
Email: tacs10@cs.okstate.edu | Fax: 405.744.9097 | www.cs.okstate.edu/tacs10