Find Jobs
Hire Freelancers

cache simulator in C

$30-250 USD

Dibatalkan
Dibuat lebih dari 9 tahun yang lalu

$30-250 USD

Dibayar ketika dikirim
cache simulator testing hit rate, total access
ID Proyek: 6863170

Tentang proyek

6 proposal
Proyek remot
Aktif 9 tahun yang lalu

Ingin menghasilkan uang?

Keuntungan menawar di Freelancer

Tentukan anggaran dan garis waktu Anda
Dapatkan bayaran atas pekerjaan Anda
Uraikan proposal Anda
Gratis mendaftar dan menawar pekerjaan
6 freelancer menawar dengan rata-rata $132 USD untuk pekerjaan ini
Avatar Pengguna
I am very proficient in c, c++. I have 15 years c++ developing experience now, and I have worked for 5 years. My work is online game developing, and mainly focus on server side, the language is c++ under linux. I used c++ to make many great projects, for example, I made the tools which can convert java files to c++ scripts which has the same effect, of course garbage collection included. I also made our own mobile game using c++, I even can show you the demo of client. Trust me, please let expert help you.
$127 USD dalam 1 hari
4,9 (107 ulasan)
6,8
6,8
Avatar Pengguna
A proposal has not yet been provided
$150 USD dalam 3 hari
4,7 (106 ulasan)
6,2
6,2
Avatar Pengguna
A proposal has not yet been provided
$111 USD dalam 3 hari
5,0 (33 ulasan)
5,2
5,2
Avatar Pengguna
Hi, I have a good knowledge of cache memories, I can handle your project efficiently. Implementing : Error handling, Output of the three elements size in bits (Tag, Set Index, Block offset) and the result of the simulation (number of Cache Hits/Misses) For the first part output of the example C=1024 B=16 E=2; We have : B = b² so b = log2(B) S = s² so s = log2(S) C = S * E * B so S = C / (E * B) t = m - s - b Where : B = the block size b = the size in bits of the block offset S = the number of sets s = the size in bits of the set index C = Cache size E = Associativity (The number of lines per Set) t = tag size in bits m = the length of the address in bits (32 bits in our case) So : S = 1024 / (2*16) = 32sets index = s = log2(32) = 5bits offset = b = log2(16) = 4bits tag = t = 32 - 5 - 4 = 23bits PS: a multiple of 2 is not 2*n but 2^n (^ = power of) Regards Marouane
$127 USD dalam 2 hari
5,0 (16 ulasan)
5,1
5,1
Avatar Pengguna
Dear sir, I have done many projects in C programming for student around the world and got some positive feedback from clients. You can check my profile for more information. Let me help you. I'm ready to get started right now. Thanks and best regards, Tinh Nguyen
$120 USD dalam 3 hari
4,9 (44 ulasan)
5,0
5,0
Avatar Pengguna
Hi, I have good knowledge of computer architecture and cache organization and can make a simulator for this in C. Thanks and Regards,
$155 USD dalam 2 hari
5,0 (8 ulasan)
3,8
3,8

Tentang klien

Bendera KOREA, REPUBLIC OF
seoul, Korea, Republic of
5,0
1
Anggota sejak Des 14, 2014

Verifikasi Klien

Terima kasih! Kami telah mengirim Anda email untuk mengklaim kredit gratis Anda.
Anda sesuatu yang salah saat mengirimkan Anda email. Silakan coba lagi.
Pengguna Terdaftar Total Pekerjaan Terpasang
Freelancer ® is a registered Trademark of Freelancer Technology Pty Limited (ACN 142 189 759)
Copyright © 2024 Freelancer Technology Pty Limited (ACN 142 189 759)
Memuat pratinjau
Izin diberikan untuk Geolokasi.
Sesi login Anda telah kedaluwarsa dan Anda sudah keluar. Silakan login kembali.