An Approach to Internal Domain-Specific Languages in Java
from author of Fest-Assert [here, here].
P.S. Fest-Assert is good example of Internal DSL in Java. In some sence is competitor of Hamcrest.
P.P.S. Yeep, i like Internal DSL and wrote about it: here about ApacheCamel, here about Hamcrest.
среда, 27 октября 2010 г.
понедельник, 11 октября 2010 г.
четверг, 7 октября 2010 г.
TPC history
Some notes on TPC history.
With tho articles:
1985: A Measure of Transaction Processing Power
2005: Thousands of DebitCredit Transactions-Per-Second: Easy and Inexpensive
P.S. TPC from tpc.org is the most popular transaction performance test.
With tho articles:
1985: A Measure of Transaction Processing Power
2005: Thousands of DebitCredit Transactions-Per-Second: Easy and Inexpensive
P.S. TPC from tpc.org is the most popular transaction performance test.
Ярлыки:
TPC,
Transaction
вторник, 5 октября 2010 г.
An Analysis of Linux Scalability to Many Cores
An Analysis of Linux Scalability to Many Cores
ABSTRACT
This paper analyzes the scalability of seven system applications (Exim, memcached, Apache, PostgreSQL, gmake, Psearchy, and MapReduce) running on Linux on a 48-core computer. Except for gmake, all applications trigger scalability bottlenecks inside a recent Linux kernel. Using mostly standard parallel programming techniques — this paper introduces one new technique, sloppy counters — these bottlenecks can be removed from the kernel or avoided by changing the applications slightly. Modifying the kernel required in total 3002 lines of code changes. A speculative conclusion from this analysis is that there is no scalability reason to give up on traditional operating system organizations just yet.
P.S. From MIT reseachers
ABSTRACT
This paper analyzes the scalability of seven system applications (Exim, memcached, Apache, PostgreSQL, gmake, Psearchy, and MapReduce) running on Linux on a 48-core computer. Except for gmake, all applications trigger scalability bottlenecks inside a recent Linux kernel. Using mostly standard parallel programming techniques — this paper introduces one new technique, sloppy counters — these bottlenecks can be removed from the kernel or avoided by changing the applications slightly. Modifying the kernel required in total 3002 lines of code changes. A speculative conclusion from this analysis is that there is no scalability reason to give up on traditional operating system organizations just yet.
P.S. From MIT reseachers
Подписаться на:
Сообщения (Atom)