Ditutup

Develop a thread-safe message queue (FIFO) using memcached

This assignment should be interesting for you assuming you already know memcached.

The goal is to implement a First-In-First-Out message queue.

The interface should implement three functions:

add(key, value) appends an value to the queue named key.

If the queue does not exist yet it should be created.

remove(key) returns the head element of the queue named key and returns

it. Should return null if the queue is empty or does not exist.

size(key) returns the size of the queue named key, null if the queue

does not exist.

## Deliverables

The goal is to implement a First-In-First-Out message queue.

The interface should implement three functions:

add(key, value) appends an value to the queue named key.

If the queue does not exist yet it should be created.

remove(key) returns the head element of the queue named key and returns

it. Should return null if the queue is empty or does not exist.

size(key) returns the size of the queue named key, null if the queue

does not exist.

You are free to use PHP or JAVA as programming language. For PHP you would use

the Memcache extension described on [url removed, login to view]

and for Java you would use spymemcached from [url removed, login to view]

If you use an object orientated approach there is no need for the parameter "key"

in every method.

key and value are of the same format as key and value of the underlying low-level

memcache library you use, so there is no need for formatting or checks.

This assignment requires to use no third party libraries other than the memcache extension

/ libraries mentioned above.

There is already a project namend memcacheQ which implements a memcached based

message queue. Unfortunately this implementation requires additional libraries (berkley db)

so it does not meet the requirements of this assignment.

The most important part: The implementation has to be 100% thead safe so you

are required to implement a thread-safe locking mechanism for add and remove.

And the other most important part: The implementation algorithm should be highly

optimized. If you apply for this assignment please state how many (how few)

low-level memcache calls you need for add/remove/size including thread-safe

locking.

The result of the project is PHP or JAVA code which implements the three functions mentioned above

and a small demo program which demonstrates the add / remove / size

functions. Text-only output is sufficient. No GUI needed.

Keahlian Teknik, Java, Linux, Microsoft, MySQL, PHP, Perancangan Perangkat Lunak, Pengujian Perangkat Lunak, Destop Windows

Lihat lebih lanjut: memcached php message queue, php fifo memcached, memcached fifo, using memcached queue, java thread safe fifo, php memcache queue, implementation php message queue, java fifo queue thread safe, php memcache message queue, queue memcached, memcache message queue, memcached queue, memcache fifo, memcached fifo php, thread programming, the most needed programming language, queue algorithm in c, programming head, object orientated programming, message interface, java programming book, java develop 7, is net a programming language, how to use algorithm, how to develop php project

Tentang Pemberi kerja:
( 4 ulasan ) Germany

ID Proyek: #3133040

3 freelancer menawar pada rata-rata $317 untuk pekerjaan ini

dancoderdan

See private message.

$255 USD dalam 3 hari
(61 Ulasan)
6.6
rajeshgautam

See private message.

$595 USD dalam 3 hari
(6 Ulasan)
6.1
softscrapelab

See private message.

$102 USD dalam 3 hari
(12 Ulasan)
5.4