• ClipSaver
ClipSaver
Русские видео
  • Смешные видео
  • Приколы
  • Обзоры
  • Новости
  • Тесты
  • Спорт
  • Любовь
  • Музыка
  • Разное
Сейчас в тренде
  • Фейгин лайф
  • Три кота
  • Самвел адамян
  • А4 ютуб
  • скачать бит
  • гитара с нуля
Иностранные видео
  • Funny Babies
  • Funny Sports
  • Funny Animals
  • Funny Pranks
  • Funny Magic
  • Funny Vines
  • Funny Virals
  • Funny K-Pop

Stanford Seminar: Beyond Floating Point: Next Generation Computer Arithmetic скачать в хорошем качестве

Stanford Seminar: Beyond Floating Point: Next Generation Computer Arithmetic 8 years ago

Stanford

Stanford University

Seminar

ee380

John L. Gustafson

Gustafson's Law

Computer Arithmetic

Singapore National University

posit

data type

Floating Point

high-performance computing

Julia Language

IEEE Standard 754 floats

approximate computing

Не удается загрузить Youtube-плеер. Проверьте блокировку Youtube в вашей сети.
Повторяем попытку...
Stanford Seminar: Beyond Floating Point: Next Generation Computer Arithmetic
  • Поделиться ВК
  • Поделиться в ОК
  •  
  •  


Скачать видео с ютуб по ссылке или смотреть без блокировок на сайте: Stanford Seminar: Beyond Floating Point: Next Generation Computer Arithmetic в качестве 4k

У нас вы можете посмотреть бесплатно Stanford Seminar: Beyond Floating Point: Next Generation Computer Arithmetic или скачать в максимальном доступном качестве, видео которое было загружено на ютуб. Для загрузки выберите вариант из формы ниже:

  • Информация по загрузке:

Скачать mp3 с ютуба отдельным файлом. Бесплатный рингтон Stanford Seminar: Beyond Floating Point: Next Generation Computer Arithmetic в формате MP3:


Если кнопки скачивания не загрузились НАЖМИТЕ ЗДЕСЬ или обновите страницу
Если возникают проблемы со скачиванием видео, пожалуйста напишите в поддержку по адресу внизу страницы.
Спасибо за использование сервиса ClipSaver.ru



Stanford Seminar: Beyond Floating Point: Next Generation Computer Arithmetic

EE380: Computer Systems Colloquium Seminar Beyond Floating Point: Next-Generation Computer Arithmetic Speaker: John L. Gustafson, National University of Singapore A new data type called a "posit" is designed for direct drop-in replacement for IEEE Standard 754 floats. Unlike unum arithmetic, posits do not require interval-type mathematics or variable size operands, and they round if an answer is inexact, much the way floats do. However, they provide compelling advantages over floats, including simpler hardware implementation that scales from as few as two-bit operands to thousands of bits. For any bit width, they have a larger dynamic range, higher accuracy, better closure under arithmetic operations, and simpler exception-handling. For example, posits never overflow to infinity or underflow to zero, and there is no "Not-a-Number" (NaN) value. Posits should take up less space to implement in silicon than an IEEE float of the same size. With fewer gate delays per operation as well as lower silicon footprint, the posit operations per second (POPS) supported by a chip can be significantly higher than the FLOPs using similar hardware resources. GPU accelerators, in particular, could do more arithmetic per watt and per dollar yet deliver superior answer quality. A series of comprehensive benchmarks compares how many decimals of accuracy can be produced for a set number of bits-per-value, using various number formats. Low-precision posits provide a better solution than "approximate computing" methods that try to tolerate decreases in answer quality. High-precision posits provide better answers (more correct decimals) than floats of the same size, suggesting that in some cases, a 32-bit posit may do a better job than a 64-bit float. In other words, posits beat floats at their own game. About the Speaker: Dr. John L. Gustafson is an applied physicist and mathematician. He is a former Director at Intel Labs and former Chief Product Architect at AMD. A pioneer in high-performance computing, he introduced cluster computing in 1985 and first demonstrated scalable massively parallel performance on real applications in 1988. This became known as Gustafson's Law, for which he won the inaugural ACM Gordon Bell Prize. He is also a recipient of the IEEE Computer Society's Golden Core Award. For more information about this seminar and its speaker, you can visit http://ee380.stanford.edu/Abstracts/1... Support for the Stanford Colloquium on Computer Systems Seminar Series provided by the Stanford Computer Forum. Colloquium on Computer Systems Seminar Series (EE380) presents the current research in design, implementation, analysis, and use of computer systems. Topics range from integrated circuits to operating systems and programming languages. It is free and open to the public, with new lectures each week. Learn more: http://bit.ly/WinYX5

Comments
  • Stanford Seminar:  Dialog Markets 8 years ago
    Stanford Seminar: Dialog Markets
    Опубликовано: 8 years ago
    1330
  • Beating Floats at Their Own Game 7 years ago
    Beating Floats at Their Own Game
    Опубликовано: 7 years ago
    5057
  • The mind behind Linux | Linus Torvalds | TED 9 years ago
    The mind behind Linux | Linus Torvalds | TED
    Опубликовано: 9 years ago
    6124113
  • General Relativity Lecture 1 12 years ago
    General Relativity Lecture 1
    Опубликовано: 12 years ago
    4254274
  • Cybersecurity Architecture: Response 1 year ago
    Cybersecurity Architecture: Response
    Опубликовано: 1 year ago
    76571
  • ИНФОУГРОЗЫ. ЭТО видео МЕНЯЕТ сознание (на 3 МЕСЯЦА) — ТОПЛЕС 4 days ago
    ИНФОУГРОЗЫ. ЭТО видео МЕНЯЕТ сознание (на 3 МЕСЯЦА) — ТОПЛЕС
    Опубликовано: 4 days ago
    2387060
  • The Unexpected Genius of Dimpled Propellers 1 day ago
    The Unexpected Genius of Dimpled Propellers
    Опубликовано: 1 day ago
    93181
  • Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 7.2 - A Single Layer of a GNN 4 years ago
    Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 7.2 - A Single Layer of a GNN
    Опубликовано: 4 years ago
    58687
  • Harvard Professor Explains Algorithms in 5 Levels of Difficulty | WIRED 1 year ago
    Harvard Professor Explains Algorithms in 5 Levels of Difficulty | WIRED
    Опубликовано: 1 year ago
    4240491
  • Cybersecurity Architecture: Application Security 1 year ago
    Cybersecurity Architecture: Application Security
    Опубликовано: 1 year ago
    133041

Контактный email для правообладателей: [email protected] © 2017 - 2025

Отказ от ответственности - Disclaimer Правообладателям - DMCA Условия использования сайта - TOS



Карта сайта 1 Карта сайта 2 Карта сайта 3 Карта сайта 4 Карта сайта 5