Sciweavers

2563 search results - page 436 / 513
» Parallel matrix algorithms and applications
Sort
View
CODES
2010
IEEE
14 years 10 months ago
Worst-case performance analysis of synchronous dataflow scenarios
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...
Marc Geilen, Sander Stuijk
107
Voted
IACR
2011
136views more  IACR 2011»
14 years 8 days ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
109
Voted
TPDS
2010
93views more  TPDS 2010»
14 years 11 months ago
Self-Consistent MPI Performance Guidelines
Message passing using the Message Passing Interface (MPI) is at present the most widely adopted framework for programming parallel applications for distributed-memory and clustere...
Jesper Larsson Träff, William D. Gropp, Rajee...
124
Voted
LCTRTS
2007
Springer
15 years 6 months ago
SWL: a search-while-load demand paging scheme with NAND flash memory
As mobile phones become increasingly multifunctional, the number and size of applications installed in phones are rapidly increasing. Consequently, mobile phones require more hard...
Jihyun In, Ilhoon Shin, Hyojun Kim
CCGRID
2001
IEEE
15 years 4 months ago
Cluster Computing in the Classroom: Topics, Guidelines, and Experiences
- With the progress of research on cluster computing, more and more universities have begun to offer various courses covering cluster computing. A wide variety of content can be ta...
Amy W. Apon, Rajkumar Buyya, Hai Jin, Jens Mache