Campus Event Calendar
Event Entry
What and Who
What is Shared-Memory?
Eli Gafni
UCLA
Talk
AG 1, AG 2, AG 3, AG 4, AG 5, SWS
Expert Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 29 June 2006
10:00
-- Not specified --
E1 5
rotunda 6th floor
Saarbrücken
Abstract
Assume a processor asynchronously writes its identifier into an
individually dedicated cell in memory and then reads all cells one by
one. The processor then returns the set of identifiers
it read. When faced with such a collection of sets, one for each
processor, what are the characteristics of the collection that make it a
possible outcome to the algorithm above and what
not.
The answer to this simply posed question may elude many researchers. The
answer brings to the table ``declarative'' approach to algorithm design,
rather than ``operational'' approach. In the tutorial, I'll present the
ramification of this approach to various questions.
----------------------------------------------------------------------------------------
Contact
Brigitta Hansen
--email hidden
passcode not visible
logged in users only
Brigitta Hansen, 06/16/2006 15:11 -- Created document.