changelog
play

Changelog f(i, j); // use A[i*N+j] and B[j*N+i] } f(i + 1, j); for - PowerPoint PPT Presentation

Aug 16, 2022 •531 likes •764 views

Changelog f(i, j); // use A[i*N+j] and B[j*N+i] } f(i + 1, j); for ( int j = ...) f(i, j); for ( int j = ...) for ( int i = ...; i += 2) { // (probably not very helpful) // unroll loop in i only } f(i + 1, j); f(i + 0, j); for ( int j = ...)

  1. Changelog f(i, j); // use A[i*N+j] and B[j*N+i] } f(i + 1, j); for ( int j = ...) f(i, j); for ( int j = ...) for ( int i = ...; i += 2) { // (probably not very helpful) // unroll loop in i only } f(i + 1, j); f(i + 0, j); for ( int j = ...) { for ( int i = ...; i += 2) // unroll + cache blocking for ( int j = ...) Changes made in this version not seen in fjrst lecture: fjnal exam 7 December 2017 at 7PM 28 November 2017: 2-level splitting: added slide 28 November 2017: 2-level exercise (3): change virtual address 0 Virtual Memory 1 exam Gilmer 130 for ( int i = ...) 2 rotate HW and cache blocking many of you seemed to think you were doing just loop unrolling… but generally changed the order of memory accesses in the process // original 3 basically cache blocking

  2. splitting addresses for levels x86-32 32-bit physical address; 32-bit virtual address 12-bit page ofgset 2-levels of page tables; each page table is one page 4 byte page table entries how is address 0x12345678 split up? 4 splitting addresses for levels 32-bit physical address; 32-bit virtual address splitting addresses for levels 12-bit page ofgset 2-levels of page tables; each page table is one page 4 byte page table entries how is address 0x12345678 split up? 10-bit VPN part 1: 0001 0010 00 (0x48) ; 10-bit VPN part 2: 11 0100 0101 (0x345) ; 12-bit page ofgset: 0x678 x86-32 x86-32 4 how is address 0x12345678 split up? 32-bit physical address; 32-bit virtual address 12-bit page ofgset 2-levels of page tables; each page table is one page 4 byte page table entries PTEs/page table; 10-bit VPN parts how is address 0x12345678 split up? 4 splitting addresses for levels x86-32 32-bit physical address; 32-bit virtual address 12-bit page ofgset 2-levels of page tables; each page table is one page 4 byte page table entries PTEs/page table; 10-bit VPN parts 4 2 12 byte page size 2 12 byte page size 2 12 byte page size 2 12 byte page size 2 12 / 4 = 2 10 PTEs/page table; 10-bit VPN parts 2 12 / 4 = 2 10 PTEs/page table; 10-bit VPN parts

  3. 1-level example page tables 1 page; PTE: 3 bit PPN (MSB), 1 valid bit, 4 other bits; 0x30 = 11 0000 0x3C-F EC 0C EC 0C physical 0x1C-F 1C 2C 3C 4C physical page table base register 0x20 ; translate virtual address 0x30 6-bit virtual addresses, 6-bit physical; 8 byte pages, 1 byte PTE PTE value: 1-level example 6-bit virtual addresses, 6-bit physical; 8 byte pages, 1 byte PTE 0xBA M[ 110 000 ] = M[ 0x30] PPN 110 , valid 1 0xD6 = 1101 0110 PTE value: PTE addr: PPN 110 , valid 1 physical physical 0xBA PPN 110 , valid 1 0xD6 = 1101 0110 PTE value: PTE addr: 0x30 = 11 0000 0x3C-F EC 0C EC 0C 0x1C-F 1C 2C 3C 4C M[ 110 000 ] = M[ 0x30] physical page table base register 0x20 ; translate virtual address 0x30 page tables 1 page; PTE: 3 bit PPN (MSB), 1 valid bit, 4 other bits; 6-bit virtual addresses, 6-bit physical; 8 byte pages, 1 byte PTE 1-level example 5 0xBA PTE addr: 5 5 1 = 0x26 page table base register 0x20 ; translate virtual address 0x30 1-level example 5 0xBA M[ 110 000 ] = M[ 0x30] PPN 110 , valid 1 0xD6 = 1101 0110 PTE value: 0x20 + 6 page tables 1 page; PTE: 3 bit PPN (MSB), 1 valid bit, 4 other bits; PTE addr: physical 0x30 = 11 0000 physical physical page table base register 0x20 ; translate virtual address 0x30 page tables 1 page; PTE: 3 bit PPN (MSB), 1 valid bit, 4 other bits; 6-bit virtual addresses, 6-bit physical; 8 byte pages, 1 byte PTE addresses bytes addresses bytes addresses bytes addresses bytes 0x30 = 11 0000 0x00-3 00 11 22 33 0x20-3 D0 D1 D2 D3 0x00-3 00 11 22 33 0x20-3 D0 D1 D2 D3 0x20 + 6 × 1 = 0x26 0x04-7 44 55 66 77 0x24-7 D4 D5 D6 D7 0x04-7 44 55 66 77 0x24-7 D4 D5 D6 D7 0x08-B 88 99 AA BB 0x28-B 89 9A AB BC 0x08-B 88 99 AA BB 0x28-B 89 9A AB BC 0x0C-F CC DD EE FF 0x2C-F CD DE EF F0 0x0C-F CC DD EE FF 0x2C-F CD DE EF F0 0x10-3 1A 2A 3A 4A 0x30-3 BA 0A BA 0A 0x10-3 1A 2A 3A 4A 0x30-3 BA 0A BA 0A 0x14-7 1B 2B 3B 4B 0x34-7 CB 0B CB 0B 0x14-7 1B 2B 3B 4B 0x34-7 CB 0B CB 0B 0x18-B 1C 2C 3C 4C 0x38-B DC 0C DC 0C 0x18-B 1C 2C 3C 4C 0x38-B DC 0C DC 0C 0x1C-F 1C 2C 3C 4C 0x3C-F EC 0C EC 0C 0x1C-F 1C 2C 3C 4C 0x3C-F EC 0C EC 0C addresses bytes addresses bytes addresses bytes addresses bytes 0x00-3 00 11 22 33 0x20-3 D0 D1 D2 D3 0x00-3 00 11 22 33 0x20-3 D0 D1 D2 D3 0x20 + 6 × 1 = 0x26 0x20 + 6 × 1 = 0x26 0x04-7 44 55 66 77 0x24-7 D4 D5 D6 D7 0x04-7 44 55 66 77 0x24-7 D4 D5 D6 D7 0x08-B 88 99 AA BB 0x28-B 89 9A AB BC 0x08-B 88 99 AA BB 0x28-B 89 9A AB BC 0x0C-F CC DD EE FF 0x2C-F CD DE EF F0 0x0C-F CC DD EE FF 0x2C-F CD DE EF F0 0xD6 = 1101 0110 0x10-3 1A 2A 3A 4A 0x30-3 BA 0A BA 0A 0x10-3 1A 2A 3A 4A 0x30-3 BA 0A BA 0A 0x14-7 1B 2B 3B 4B 0x34-7 CB 0B CB 0B 0x14-7 1B 2B 3B 4B 0x34-7 CB 0B CB 0B 0x18-B 1C 2C 3C 4C 0x38-B DC 0C DC 0C 0x18-B 1C 2C 3C 4C 0x38-B DC 0C DC 0C M[ 110 000 ] = M[ 0x30]

  4. 2-level example physical PPN 110 , valid 1 0xD4 = 1101 0100 PTE 1 value: 0x131 = 1 0011 0001 0x3C-F FC 0C FC 0C physical 0x1C-F 1C 2C 3C 4C 9-bit virtual addresses, 6-bit physical; 8 byte pages, 1 byte PTE 110 000 + 110 = 0x36 page tables 1 page; PTE: 3 bit PPN (MSB), 1 valid bit, 4 unused 9-bit virtual addresses, 6-bit physical; 8 byte pages, 1 byte PTE 2-level example 6 PPN 110 , valid 1 0xD4 = 1101 0100 PTE 1 value: PTE 2 addr: PTE 2 value: 0xDB physical 0x131 = 1 0011 0001 M[ 110 001 ( 0x31 )] = 0x0A PTE 2 value: 0xDB 110 000 + 110 = 0x36 PTE 2 addr: PPN 110 , valid 1 0xD4 = 1101 0100 PTE 1 value: 0x3C-F FC 0C FC 0C 6 physical 0x1C-F 1C 2C 3C 4C physical page table base register 0x20 ; translate virtual address 0x131 page tables 1 page; PTE: 3 bit PPN (MSB), 1 valid bit, 4 unused 9-bit virtual addresses, 6-bit physical; 8 byte pages, 1 byte PTE 2-level example 0x131 = 1 0011 0001 page table base register 0x20 ; translate virtual address 0x131 6 physical page tables 1 page; PTE: 3 bit PPN (MSB), 1 valid bit, 4 unused page table base register 0x20 ; translate virtual address 0x131 physical physical 0x131 = 1 0011 0001 0x20 + 4 PTE 1 value: 0xD4 = 1101 0100 PPN 110 , valid 1 6 2-level example 9-bit virtual addresses, 6-bit physical; 8 byte pages, 1 byte PTE page tables 1 page; PTE: 3 bit PPN (MSB), 1 valid bit, 4 unused page table base register 0x20 ; translate virtual address 0x131 1 = 0x24 addresses bytes addresses bytes addresses bytes addresses bytes 0x20 + 4 × 1 = 0x24 0x00-3 00 11 22 33 0x20-3 D0 D1 D2 D3 0x00-3 00 11 22 33 0x20-3 D0 D1 D2 D3 0x04-7 44 55 66 77 0x24-7 D4 D5 D6 D7 0x04-7 44 55 66 77 0x24-7 D4 D5 D6 D7 0x08-B 88 99 AA BB 0x28-B 89 9A AB BC 0x08-B 88 99 AA BB 0x28-B 89 9A AB BC 0x0C-F CC DD EE FF 0x2C-F CD DE EF F0 0x0C-F CC DD EE FF 0x2C-F CD DE EF F0 0x10-3 1A 2A 3A 4A 0x30-3 BA 0A BA 0A 0x10-3 1A 2A 3A 4A 0x30-3 BA 0A BA 0A 0x14-7 1B 2B 3B 4B 0x34-7 DB 0B DB 0B 0x14-7 1B 2B 3B 4B 0x34-7 DB 0B DB 0B 0x18-B 1C 2C 3C 4C 0x38-B EC 0C EC 0C 0x18-B 1C 2C 3C 4C 0x38-B EC 0C EC 0C 0x1C-F 1C 2C 3C 4C 0x3C-F FC 0C FC 0C 0x1C-F 1C 2C 3C 4C 0x3C-F FC 0C FC 0C 0x20 + 4 × 1 = 0x24 addresses bytes addresses bytes addresses bytes addresses bytes 0x20 + 4 × 1 = 0x24 0x00-3 00 11 22 33 0x20-3 D0 D1 D2 D3 0x00-3 00 11 22 33 0x20-3 D0 D1 D2 D3 0x04-7 44 55 66 77 0x24-7 D4 D5 D6 D7 0x04-7 44 55 66 77 0x24-7 D4 D5 D6 D7 0x08-B 88 99 AA BB 0x28-B 89 9A AB BC 0x08-B 88 99 AA BB 0x28-B 89 9A AB BC 0x0C-F CC DD EE FF 0x2C-F CD DE EF F0 0x0C-F CC DD EE FF 0x2C-F CD DE EF F0 0x10-3 1A 2A 3A 4A 0x30-3 BA 0A BA 0A 0x10-3 1A 2A 3A 4A 0x30-3 BA 0A BA 0A 0x14-7 1B 2B 3B 4B 0x34-7 DB 0B DB 0B 0x14-7 1B 2B 3B 4B 0x34-7 DB 0B DB 0B PPN 110 ; valid 1 0x18-B 1C 2C 3C 4C 0x38-B EC 0C EC 0C 0x18-B 1C 2C 3C 4C 0x38-B EC 0C EC 0C

  5. 2-level example PPN 110 ; valid 1 9-bit virtual addresses, 6-bit physical; 8 byte pages, 1 byte PTE page tables 1 page; PTE: 3 bit PPN (MSB), 1 valid bit, 4 unused page table base register 0x20 ; translate virtual address 0x131 physical 9-bit virtual addresses, 6-bit physical; 8 byte pages, 1 byte PTE physical 0x131 = 1 0011 0001 PTE 1 value: 0xD4 = 1101 0100 PPN 110 , valid 1 PTE 2 addr: 110 000 + 110 = 0x36 PTE 2 value: 0xDB M[ 110 001 ( 0x31 )] = 0x0A 6 6 2-level splitting 9-bit virtual address 6-bit physical address 9-bit VA: 6 bit VPN + 3 bit PO 6-bit PA: 6 bit PPN + 3 bit PO 9-bit VA: 3 bit VPN part 1; 3 bit VPN part 2 7 pages and page table base pointer page table base pointer — only for fjrst-level lookup zeroth page table entry 1st-level page table entry contains physical page number multiply page number by page size to get byte address of page (then same process as using page table base pointer) 2-level example 8 0x131 = 1 0011 0001 physical PTE 2 value: 0xDB 110 000 + 110 = 0x36 PTE 2 addr: PPN 110 , valid 1 0xD4 = 1101 0100 PPN 110 ; valid 1 physical PTE 1 value: page tables 1 page; PTE: 3 bit PPN (MSB), 1 valid bit, 4 unused page table base register 0x20 ; translate virtual address 0x131 0x20 + 4 × 1 = 0x24 0x20 + 4 × 1 = 0x24 addresses bytes addresses bytes addresses bytes addresses bytes 0x00-3 00 11 22 33 0x20-3 D0 D1 D2 D3 0x00-3 00 11 22 33 0x20-3 D0 D1 D2 D3 0x04-7 44 55 66 77 0x24-7 D4 D5 D6 D7 0x04-7 44 55 66 77 0x24-7 D4 D5 D6 D7 0x08-B 88 99 AA BB 0x28-B 89 9A AB BC 0x08-B 88 99 AA BB 0x28-B 89 9A AB BC 0x0C-F CC DD EE FF 0x2C-F CD DE EF F0 0x0C-F CC DD EE FF 0x2C-F CD DE EF F0 0x10-3 1A 2A 3A 4A 0x30-3 BA 0A BA 0A 0x10-3 1A 2A 3A 4A 0x30-3 BA 0A BA 0A 0x14-7 1B 2B 3B 4B 0x34-7 DB 0B DB 0B 0x14-7 1B 2B 3B 4B 0x34-7 DB 0B DB 0B 0x18-B 1C 2C 3C 4C 0x38-B EC 0C EC 0C 0x18-B 1C 2C 3C 4C 0x38-B EC 0C EC 0C M[ 110 001 ( 0x31 )] = 0x0A 0x1C-F 1C 2C 3C 4C 0x3C-F FC 0C FC 0C 0x1C-F 1C 2C 3C 4C 0x3C-F FC 0C FC 0C 8-byte pages → 3-bit page ofgset (bottom bits) 8 entry page tables → 3-bit VPN parts

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Changelog Changes made in this version not seen in fjrst lecture: sz is one past the end of the

Changelog Changes made in this version not seen in fjrst lecture: sz is one past the end of the

Changelog Changes made in this version not seen in fjrst lecture: sz is one past the end of the heap 0 2 November: Correct space on demand from to < and > to since Virtual Memory 1 1 last time deadlock thread A holding a

2.01k views • 162 slides
I/O 2 / Filesystems 1 1 Changelog Changes made in this version not seen in fjrst lecture: 13

I/O 2 / Filesystems 1 1 Changelog Changes made in this version not seen in fjrst lecture: 13

I/O 2 / Filesystems 1 1 Changelog Changes made in this version not seen in fjrst lecture: 13 November: Correct cluster number on FAT directory entry slide. 1 last time page replacement modifjcations for scanning Linux: guess fjle pages used

2.03k views • 95 slides
Distributed 3: Network FS (fjnish) / Failure 1 Changelog Changes made in this version not seen

Distributed 3: Network FS (fjnish) / Failure 1 Changelog Changes made in this version not seen

Distributed 3: Network FS (fjnish) / Failure 1 Changelog Changes made in this version not seen in fjrst lecture: 16 April 2019: move and relocate Coda/disconnected operation slides to better explain connection to last-writer-wins being a

1.45k views • 123 slides
The GNU Radio Companion Changelog Communicatjons Engineering Lab Prof. i.R. Dr.rer.nat. Friedrich

The GNU Radio Companion Changelog Communicatjons Engineering Lab Prof. i.R. Dr.rer.nat. Friedrich

The GNU Radio Companion Changelog Communicatjons Engineering Lab Prof. i.R. Dr.rer.nat. Friedrich K. Jondral KIT Universitt des Landes Baden-Wrttemberg und www.kit.edu nationales Forschungszentrum in der Helmholtz-Gemeinschaft Overview

448 views • 23 slides
bitwise (fjnish) / SEQ part 1 1 Changelog Changes made in this version not seen in fjrst

bitwise (fjnish) / SEQ part 1 1 Changelog Changes made in this version not seen in fjrst

bitwise (fjnish) / SEQ part 1 1 Changelog Changes made in this version not seen in fjrst lecture: 14 September 2017: slide 16-17: the x86 arithmetic shift instruction is sar , not sra 1 last time bitwise strategies: construct/apply mask =

890 views • 86 slides
capabilities / virtual machines 1 Changelog Changes not seen in fjrst lecture: 23 April 2020:

capabilities / virtual machines 1 Changelog Changes not seen in fjrst lecture: 23 April 2020:

capabilities / virtual machines 1 Changelog Changes not seen in fjrst lecture: 23 April 2020: add index slides re: cases for priviliged instruction handling and introduction explaining syscalls as special case 1 last time (1) network fjle

1.71k views • 120 slides
Optimization part 1 1 Changelog Changes made in this version not seen in fjrst lecture: 29 Feb

Optimization part 1 1 Changelog Changes made in this version not seen in fjrst lecture: 29 Feb

Optimization part 1 1 Changelog Changes made in this version not seen in fjrst lecture: 29 Feb 2018: loop unrolling performance: remove bogus instruction cache overhead remark 1 29 Feb 2018: spatial locality in Akj: correct reference to B k +1

1.03k views • 63 slides
web security (part 2) 1 Changelog Corrections made in this version not in fjrst posting: 25

web security (part 2) 1 Changelog Corrections made in this version not in fjrst posting: 25

web security (part 2) 1 Changelog Corrections made in this version not in fjrst posting: 25 April 2017: removed text about reading contents without sending cokoies from operations not requiring same origin slide. (This can be done with

998 views • 77 slides
Changelog Changes made in this version not seen in fjrst lecture: 5 Feb 2019: precedence note:

Changelog Changes made in this version not seen in fjrst lecture: 5 Feb 2019: precedence note:

Changelog Changes made in this version not seen in fjrst lecture: 5 Feb 2019: precedence note: replace array subscripts with 42 to avoid using special numbers like 0 and 1 that make examples less clear 0 assembly 2 / C 1 last time object

1.66k views • 134 slides
Virtual Memory 2 1 Changelog Changes made in this version not seen in fjrst lecture: 23

Virtual Memory 2 1 Changelog Changes made in this version not seen in fjrst lecture: 23

Virtual Memory 2 1 Changelog Changes made in this version not seen in fjrst lecture: 23 October: mapped pages (no backing fjle): fjx end of animation to have page on disk 23 October: separate out discussion of readahead from other reasons why

1.79k views • 152 slides
Changelog Changes made in this version not seen in fjrst lecture: 6 September: fjx stray @s on

Changelog Changes made in this version not seen in fjrst lecture: 6 September: fjx stray @s on

Changelog Changes made in this version not seen in fjrst lecture: 6 September: fjx stray @s on implementing fjle descriptors in xv6 slide 6 September: typical pattern with redirection: hilite parts of code more sensibly 6 September: exec

912 views • 77 slides
context switches/POSIX API 1 Changelog Changes made in this version not seen in fjrst lecture:

context switches/POSIX API 1 Changelog Changes made in this version not seen in fjrst lecture:

context switches/POSIX API 1 Changelog Changes made in this version not seen in fjrst lecture: 24 Jan 2019: wait: return value for WNOHANG when process not done is 0, not -1 1 last time system call fmow in xv6 other exceptions in xv6

1.7k views • 138 slides
1 Changelog Changes made in this version not seen in fjrst lecture: 25 September: add back

1 Changelog Changes made in this version not seen in fjrst lecture: 25 September: add back

1 Changelog Changes made in this version not seen in fjrst lecture: 25 September: add back stages walkthrough slides 1 last time mov CPU build incrementally difgerent things for difgerent instructions add MUX MUX controls = function of

1.22k views • 107 slides
synchronization 3: rwlocks / deadlock 1 Changelog Changes not seen in fjrst lecture: 20 Feb

synchronization 3: rwlocks / deadlock 1 Changelog Changes not seen in fjrst lecture: 20 Feb

synchronization 3: rwlocks / deadlock 1 Changelog Changes not seen in fjrst lecture: 20 Feb 2020: moving two fjles graphs: make directory names consistent with code 20 Feb 2020: is deadlock exercise: correct option lettering 20 Feb 2020:

1.52k views • 120 slides
Virtual Memory 1 Changelog Changes made in this version not seen in fjrst lecture: 16 November

Virtual Memory 1 Changelog Changes made in this version not seen in fjrst lecture: 16 November

Virtual Memory 1 Changelog Changes made in this version not seen in fjrst lecture: 16 November 2017: shared libraries: clarifjed that its multiple read-only virtual copies backed by one physical copy 1 SIMD notes (1) sorry for two typos:

1.42k views • 99 slides
two-phase commit / security (start) 1 Changelog Changes made in this version not seen in fjrst

two-phase commit / security (start) 1 Changelog Changes made in this version not seen in fjrst

two-phase commit / security (start) 1 Changelog Changes made in this version not seen in fjrst lecture: quorum: add note that part of voting is updating other nodes to latest version 1 last time (1) RPC: remote function calls like local

1.05k views • 78 slides
CSE101: Algorithm Design and Analysis Russell Impagliazzo Sanjoy Dasgupta Ragesh Jaiswal

CSE101: Algorithm Design and Analysis Russell Impagliazzo Sanjoy Dasgupta Ragesh Jaiswal

CSE101: Algorithm Design and Analysis Russell Impagliazzo Sanjoy Dasgupta Ragesh Jaiswal (Thanks for slides: Miles Jones) Week-06 Lecture 21: Divide and Conquer (Multiplication) DIVIDE AND CONQUER Divide and Conquer Break a problem into

591 views • 30 slides
parametric spline curves 1 curves used in many contexts fonts (2D) animation paths (3D) shape

parametric spline curves 1 curves used in many contexts fonts (2D) animation paths (3D) shape

parametric spline curves 1 curves used in many contexts fonts (2D) animation paths (3D) shape modeling (3D) different representation implicit curves parametric curves (mostly used) 2D and 3D curves are mostly the same use vector notation

724 views • 35 slides
Talk: Time-Decomposition Methods for Parabolic Problems : Convergence results of Iterative

Talk: Time-Decomposition Methods for Parabolic Problems : Convergence results of Iterative

17 th International Conference on Domain Decomposition Methods St. Wolfgang/Strobl, Austria, July 3-7, 2006 July 3, 2006, Minisymposium of Martin Gander Talk: Time-Decomposition Methods for Parabolic Problems : Convergence results of Iterative

877 views • 45 slides
Review 1 Single Digit Addition: 5 + 2 = ? Two Digit Addition: Review 1 Continued Doubling: 7 + 7

Review 1 Single Digit Addition: 5 + 2 = ? Two Digit Addition: Review 1 Continued Doubling: 7 + 7

Hi Everyone Welcome to class! July 28 Review 1 Single Digit Addition: 5 + 2 = ? Two Digit Addition: Review 1 Continued Doubling: 7 + 7 = ? Halving: Opposite Operations Double and half are opposite operations Addition and subtraction

768 views • 42 slides
1 I t Introduction d ti

1 I t Introduction d ti

Secret Sharing and Threshold Cryptography 1 I t Introduction d ti Story #1: A millionaire put all his estate in a safe and leaves y p the combination to his seven

690 views • 47 slides
Gentoo & KDE Packages, Compilation & Interaction Marcus D. Hanwell cryos@gentoo.org

Gentoo & KDE Packages, Compilation & Interaction Marcus D. Hanwell cryos@gentoo.org

Introduction KDE Core Applications & Libraries Interaction KDE 4The Future Gentoo & KDE Packages, Compilation & Interaction Marcus D. Hanwell cryos@gentoo.org Gentoo Linux aKademy 2007 1 July, 2007 Marcus D. Hanwell

555 views • 19 slides
A Latin square autotopism secret sharing scheme Talk by Rebecca J. Stones Co-authors: Ming Su,

A Latin square autotopism secret sharing scheme Talk by Rebecca J. Stones Co-authors: Ming Su,

A Latin square autotopism secret sharing scheme Talk by Rebecca J. Stones Co-authors: Ming Su, Xiaoguang Liu, Gang Wang, (Nankai University) and Sheng Lin (Tianjin University of Technology). September 12, 2014 Secret sharing schemes Secret

1.43k views • 86 slides
Designing an ultra low-overhead multithreading runtime for Nim Mamy Ratsimbazafy Weave

Designing an ultra low-overhead multithreading runtime for Nim Mamy Ratsimbazafy Weave

Designing an ultra low-overhead multithreading runtime for Nim Mamy Ratsimbazafy Weave mamy@numforge.co https://github.com/mratsim/weave Hello! I am Mamy Ratsimbazafy During the day blockchain/Ethereum 2 developer (in Nim) During the night,

388 views • 37 slides

More recommend