Skip to content

Instantly share code, notes, and snippets.

View rahulaga's full-sized avatar

Rahul rahulaga

View GitHub Profile
File Size (bytes) Packet Size (bytes) Number of Packets Transfer Time (ms) Throughput (bps) Avg Packet Delay (ms)
113727 512 222 610 1491501.63 2.7477
211478 512 413 1260 1342717.46 3.0508
19463736 700 27805 63610 2447883.79 2.2877
113727 700 162 550 1654210.90 3.3950
113727 1024 111 330 2757018.18 2.9729
@rahulaga
rahulaga / MaskingConverter.java
Created February 9, 2017 17:23
Logback masking
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.regex.Pattern;
import org.apache.commons.lang3.StringUtils;
import ch.qos.logback.classic.pattern.ClassicConverter;
import ch.qos.logback.classic.spi.ILoggingEvent;
//1. Auth API
//Controller
class AuthenticationResource {
//some implementation of interface is provided here
private AuthenticationService authService;
@Path("/authenticate")
public Response authenticate(String username, String password){
//call service and map exception
@rahulaga
rahulaga / scanning.c
Created November 23, 2015 04:28
Parallel Computing - MPI - Scanning Text
//CS3211 Scanning Text
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include "mpi.h"
@rahulaga
rahulaga / image.c
Created November 23, 2015 04:22
MPI, Image Processor
#include "mpi.h"
#include <stdio.h>
#include <math.h>
#define BUFLEN 100
void main(int argc, char *argv[])
@rahulaga
rahulaga / gaussian.scm
Created November 23, 2015 02:51
Scheme Gaussian Elimination
;####################
;Gaussian Elimination
;Rahul Agarwal
;###################
;#################################################################
;Test if value is a valid linear equation, helper is part
;of linear-equation? so not testing seperately
;#################################################################
(define (le-helper value)
@rahulaga
rahulaga / recursion.java
Created March 14, 2014 04:25
Recursion
public static void recurse(int n) {
if (n <= 0)
return;
else {
n=n-1;
recurse(n);
System.out.println(n);
return;
}
}
@rahulaga
rahulaga / fibonacci.java
Last active August 29, 2015 13:57
Fibonacci series
public static int fib(int n) {
if (n == 0)
return 1;
if (n == 1)
return 1;
return fib(n - 1) + fib(n - 2);
}
@rahulaga
rahulaga / recursive-sum.java
Last active August 29, 2015 13:57
Recursive Sum
public static int sum(int n) {
if (n == 1)
return 1;
else
return sum(n - 1) + n;
}