Unfortunately, preemption and CPU migration overheads limits pfair performance. Global earliest deadline scheduling is, practically speaking, the best algorithm for soft realtime scheduling.
BTW, the research group that published the paper you linked also maintains a Linux testbed (Litmus^RT) to test real-time scheduling (pfair, various deadline schedulers) and synchronization algorithms: http://www.cs.unc.edu/~anderson/litmus-rt/