| 2009 |
|---|
| 43 | EE | Michal Kostal,
Pavel Tvrdík:
Market-Based Batch System.
ICDS 2009: 202-207 |
| 2007 |
|---|
| 42 | | Michal Kostal,
Pavel Tvrdík:
System for trading processors' quanta on a digital market.
ISCA PDCS 2007: 133-138 |
| 41 | EE | Martin Stáva,
Pavel Tvrdík:
File System Security in the Environment of Non-dedicated Computer Clusters.
PDCAT 2007: 445-452 |
| 40 | EE | Ivan Simecek,
Pavel Tvrdík:
Sparse Matrix-Vector Multiplication - Final Solution?.
PPAM 2007: 156-165 |
| 2006 |
|---|
| 39 | EE | Pavel Tvrdík,
Ivan Simecek:
A New Approach for Accelerating the Sparse Matrix-Vector Multiplication.
SYNASC 2006: 156-163 |
| 38 | EE | Petr Salinger,
Pavel Tvrdík:
Broadcasting in all-output-port cube-connected cycles with distance-insensitive switching.
J. Parallel Distrib. Comput. 66(8): 1103-1110 (2006) |
| 2005 |
|---|
| 37 | EE | Martin Kacer,
D. Langr,
Pavel Tvrdík:
Clondike: Linux cluster of non-dedicated workstations.
CCGRID 2005: 574-581 |
| 36 | EE | Pavel Tvrdík,
Ivan Simecek:
A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices.
PPAM 2005: 164-171 |
| 35 | | Ondrej Medek,
Pavel Tvrdík:
Quality Balancing Heuristics with Three Variants of Sloan Algorithm.
Parallel and Distributed Computing and Networks 2005: 644-650 |
| 2004 |
|---|
| 34 | EE | Ondrej Medek,
Pavel Tvrdík,
Jaroslav Kruis:
Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method.
Euro-Par 2004: 734-741 |
| 33 | EE | Ivan Simecek,
Pavel Tvrdík:
Analytical Model for Analysis of Cache Behavior during Cholesky Factorization and Its Variants.
ICPP Workshops 2004: 190-197 |
| 32 | EE | Ondrej Medek,
Pavel Tvrdík:
Variable Reordering for a Parallel Envelope Method.
ICPP Workshops 2004: 254-261 |
| 31 | EE | Pavel Tvrdík,
Ivan Simecek:
Performance Optimization and Evaluation for Linear Codes.
NAA 2004: 566-573 |
| 2003 |
|---|
| 30 | EE | Radim Ballner,
Pavel Tvrdík:
MOOSS: CPU Architecture with Memory Protection and Support for OOP.
Asia-Pacific Computer Systems Architecture Conference 2003: 97-111 |
| 29 | EE | Pavel Tvrdík,
Ivan Simecek:
Analytical Modeling of Optimized Sparse Linear Code.
PPAM 2003: 207-216 |
| 2002 |
|---|
| 28 | EE | Martin Kacer,
Pavel Tvrdík:
Load Balancing by Remote Execution of Short Processes on Linux Clusters.
CCGRID 2002: 276-277 |
| 27 | | Libor Bus,
Pavel Tvrdík:
Distributed Memory Auction Algorithms for the Linear Assignment Problem.
IASTED PDCS 2002: 137-142 |
| 26 | | Tomas Liska,
Pavel Tvrdík:
Intelligent Mobile Agent Based E-Auctions.
ICWI 2002: 209-216 |
| 25 | EE | Petr Salinger,
Pavel Tvrdík:
Broadcasting in All-Output-Port Meshes of Trees with Distance-Insensitive Switching.
J. Parallel Distrib. Comput. 62(8): 1272-1294 (2002) |
| 24 | | Petr Salinger,
Pavel Tvrdík:
Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing.
Parallel Computing 28(4): 627-647 (2002) |
| 2001 |
|---|
| 23 | EE | Libor Bus,
Pavel Tvrdík:
A Parallel Algorithm for Connected Components on Distributed Memory Machines.
PVM/MPI 2001: 280-287 |
| 22 | | Petr Salinger,
Pavel Tvrdík:
Broadcasting in all-output-port cube-connected cycles with distance-insensitive routing.
SIROCCO 2001: 321-336 |
| 21 | | Petr Salinger,
Pavel Tvrdík:
All-to-All Scatter in de Bruijn and Kautz Networks.
Computers and Artificial Intelligence 20(4): (2001) |
| 2000 |
|---|
| 20 | EE | Petr Salinger,
Pavel Tvrdík:
Broadcasting in All-Port Wormhole 3-D Meshes of Trees (Research Note).
Euro-Par 2000: 931-934 |
| 19 | EE | Petr Salinger,
Pavel Tvrdík:
Optimal Broadcasting in All-Port Meshes of Trees with Distance-Insensitive Routing.
IPDPS 2000: 353-358 |
| 18 | | Jan Trdlicka,
Pavel Tvrdík:
Embedding complete k-ary trees into k-square 2-D meshes with optimal edge congestion.
Parallel Computing 26(6): 783-790 (2000) |
| 1999 |
|---|
| 17 | | Jan Trdlicka,
Pavel Tvrdík:
Optimal k-ary Divide and Conquer Computations on Wormhole 2-D and 3-D Meshes.
HiPC 1999: 253-260 |
| 16 | EE | Michal Soch,
Pavel Tvrdík:
Time-Optimal Gossip of Large Packets in Noncombining 2D Tori and Meshes.
IEEE Trans. Parallel Distrib. Syst. 10(12): 1252-1261 (1999) |
| 1998 |
|---|
| 15 | EE | Michal Soch,
Pavel Tvrdík:
Time-Optimal Gossip in Noncombining 2-D Tori with Constant Buffers.
Euro-Par 1998: 1047-1050 |
| 14 | EE | Petr Salinger,
Pavel Tvrdík:
All-to-all Scatter in Kautz Networks.
Euro-Par 1998: 1057-1061 |
| 13 | EE | Pavel Kopriva,
Pavel Tvrdík:
Decompositions of de Bruijn Networks.
ICPADS 1998: 580- |
| 12 | | Michal Soch,
Pavel Tvrdík:
Time-optimal gossip in noncombining 3-D tori.
SIROCCO 1998: 259-271 |
| 11 | EE | Pavel Tvrdík,
Rabah Harbane,
Marie-Claude Heydemann:
Uniform homomorphisms of de Bruijn and Kautz networks.
Discrete Applied Mathematics 83(1-3): 279-301 (1998) |
| 10 | EE | José D. P. Rolim,
Pavel Tvrdík,
Jan Trdlicka,
Imrich Vrto:
Bisecting De Bruijn and Kautz Graphs.
Discrete Applied Mathematics 85(1): 87-97 (1998) |
| 9 | | Jan Trdlicka,
Pavel Tvrdík:
Embedding of k-ary Complete Trees into Hypercubes with Uniform Load.
J. Parallel Distrib. Comput. 52(2): 120-131 (1998) |
| 1997 |
|---|
| 8 | | Jan Trdlicka,
Pavel Tvrdík:
Embedding Complete k-ary Trees into 2-dimensional Meshes and Tori.
Euro-Par 1997: 226-233 |
| 7 | | Michal Soch,
Pavel Tvrdík:
Optimal Gossip in Store-and-Forward Noncombining 2-D Tori.
Euro-Par 1997: 234-241 |
| 6 | | Michal Soch,
Pavel Tvrdík,
Martin Volf:
Parallel Graph-Partitioning Using the Mob Heuristic.
PVM/MPI 1997: 383-389 |
| 5 | | Michal Soch,
Pavel Tvrdík:
Optimal gossip in noncombining 2D-meshes.
SIROCCO 1997: 253-265 |
| 1996 |
|---|
| 4 | | Michal Soch,
Jan Trdlicka,
Pavel Tvrdík:
PVM, Computational Geometry, and Parallel Computing Course.
PVM 1996: 38-44 |
| 3 | | Pavel Tvrdík:
Necklace-based Factorization of de Bruijn Digraphs.
SIROCCO 1996: 255-168 |
| 1995 |
|---|
| 2 | | José D. P. Rolim,
Pavel Tvrdík,
Jan Trdlicka,
Imrich Vrto:
Bisecting de Bruijn and Kautz Graphs.
SIROCCO 1995: 211-222 |
| 1992 |
|---|
| 1 | | Pavel Tvrdík:
On Incomplete Hypercubes.
CONPAR 1992: 13-24 |
