merinjo Goto Github PK

center-star-algorithm-in-java

closest-sequence-problem

github-pr-resource

Github pull request resource for Concourse

go-snmp

GO SNMP Trap receiver and SNMP Get/Walk client

gosnmp

An SNMP library written in GoLang.

parallel-histogram

parallel-matrix-multiply

In this parallel strategy, rows and columns were partitioned into 4 so matrix A and B was partitioned into 4*4 block matrices. The tile width would be 512/4 = 128. At a time one block matrix A and B was brought to shared memory and all the threads computed on those data. Each thread would work on 128/64 = 2 columns of the block of matrix B. In parallel 64 threads would be working on a block at a time. The block sequence would be: First block of first row of C = first block of first row of c + (first block of first row of A * first block of first column of B) + (second block of first row of A * second block of first column of B) + … (fourth block of first row of A * fourth block of first column of B). This technique exploits both spatial and temporal locality of data since reuse of adjacent dataset and reuse of same dataset.

parallel-prefix-scan

The parallel algorithm is divided into 4 steps.1.First the input array is divided into blocks equally between the total number of threads and for each block prefix scan is done serially. But each block is worked upon in parallel by the threads. 2. An array is created with as many elements as there are threads in the program. The elements in this array were the sum of elements in one block. 3.This array goes through the reduction step and post scan step. 4. After the reduction and post scan step the elements in the array are used to increment each block of input array to achieve the required prefix scan output.

parallel-quick-sort

pcileech

Direct Memory Access (DMA) Attack Software

rsa-montgomery-ladder-implementation

Implementation of the Montgomery’s ladder for exponentiation algorithm of a 128 byte message with a 64 byte (512 bits) secret exponent

virtual-to-physical-address-conversion-linux-

Protecting systems in the filed of Security is of great concern. Research work done over ORAMs consider the DRAM to be an untrusted party while considering the processor trusted. In order to launch an attack over the system such as cache side channel attacks, exploting DMA to leak private information etc. we need to have access to the physical address space. As our kernels, applications and all other codes run in the virtual address space. Using this code, one can determine the physical address of a variable/buffer etc.