Sciweavers

364 search results - page 61 / 73
» Very Efficient Balanced Codes
Sort
View
JEA
1998
133views more  JEA 1998»
13 years 7 months ago
A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation
We introduce a new deterministic parallel sorting algorithm based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communica...
David R. Helman, Joseph JáJá, David ...
TVLSI
2010
13 years 2 months ago
Asynchronous Current Mode Serial Communication
Abstract--An asynchronous high-speed wave-pipelined bit-serial link for on-chip communication is presented as an alternative to standard bit-parallel links. The link employs the di...
Rostislav (Reuven) Dobkin, Michael Moyal, Avinoam ...
ISCA
2011
IEEE
269views Hardware» more  ISCA 2011»
12 years 11 months ago
Crafting a usable microkernel, processor, and I/O system with strict and provable information flow security
High assurance systems used in avionics, medical implants, and cryptographic devices often rely on a small trusted base of hardware and software to manage the rest of the system. ...
Mohit Tiwari, Jason Oberg, Xun Li 0001, Jonathan V...
ITIIS
2010
137views more  ITIIS 2010»
13 years 6 months ago
Improving the Availability of Scalable on-demand Streams by Dynamic Buffering on P2P Networks
In peer-to-peer (P2P) on-demand streaming networks, the alleviation of server load depends on reciprocal stream sharing among peers. In general, on-demand video services enable cl...
Chow-Sing Lin
FTDCS
2004
IEEE
13 years 11 months ago
The vMatrix: Server Switching
Today most Internet services are pre-assigned to servers statically, hence preventing us from doing real-time sharing of a pool of servers across as group of services with dynamic...
Amr Awadallah, Mendel Rosenblum