11 KiB
created_at | title | url | author | points | story_text | comment_text | num_comments | story_id | story_title | story_url | parent_id | created_at_i | _tags | objectID | year | |||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2017-11-06T17:06:27.000Z | Some Thoughts About Concurrency by Ivan Sutherland (2010) [video] | https://www.youtube.com/watch?v=jR9pAaQlVRc | dang | 71 | 8 | 1509987987 |
|
15636865 | 2010 |
Some Thoughts About Concurrency by Ivan Sutherland, Visiting Scientist at Portland State University - YouTube
Skip navigation
Sign in
Search
Loading...
Close
Yeah, keep it Undo Close
This video is unavailable.
Watch Queue
Queue
Watch QueueQueue
- Remove all
- Disconnect
The next video is startingstop
Loading...
Watch Queue
Queue
count/total
Find out whyClose
Some Thoughts About Concurrency by Ivan Sutherland, Visiting Scientist at Portland State University
Loading...
Unsubscribe from USENIX?
Cancel Unsubscribe
Working...
SubscribeSubscribedUnsubscribe8.3K
Loading...
Loading...
Working...
Add to
Want to watch this again later?
Sign in to add this video to a playlist.
Share
More
- Report
Need to report the video?
Sign in to report inappropriate content.
- Transcript
- Statistics Add translations
5,152 views
55
Like this video?
Sign in to make your opinion count.
56 0
Don't like this video?
Sign in to make your opinion count.
1
Loading...
Loading...
Transcript
The interactive transcript could not be loaded.
Loading...
Loading...
Rating is available when the video has been rented.
This feature is not available right now. Please try again later.
Published on Jul 23, 2010
Our industry has grown up with a sequential model of computing, evolved to husband the logic associated with a few vacuum tubes. Now we must struggle to harness the vast concurrency of modern transistor circuits. Is concurrency fundamentally hard, or does it just seem hard because of our history of sequential programming? I believe some of each. Concurrency is fundamentally hard for only two reasons. One is that concurrent action requires coordination. The other is that concurrent action of many processes can produce an exponential explosion of states. How can we be sure that all such states are benign?
Concurrency is easy when we escape its details. Maybe instead of "programming sequential processes" we might better "configure concurrent communication." A communication view of computing matches well the cost structure of modern hardware, where logic is now essentially free but moving data is relatively slow and expensive in time and energy. Making communication central to computation also prepares us for the increasing role geometry will play in the future of computing. New thinking may be essential to harnessing the vast concurrency provided by modern transistor circuits.
-
Category
-
License
- Standard YouTube License
Show more Show less
Loading...
Autoplay When autoplay is enabled, a suggested video will automatically play next.
Up next
- Loading more suggestions...
Show more
- Language: English
- Location: United States
- Restricted Mode: Off History Help
Loading...
Loading...
Loading...
- About
- Press
- Copyright
- Creators
- Advertise
- Developers
- +YouTube
- Terms
- Privacy
- Policy & Safety
- Send feedback
- Test new features
- Loading...
Working...
Sign in to add this to Watch Later
Add to
Loading playlists...