[jira] [Comment Edited] (HBASE-12790) Support fairness across parallelized scans

["ramkrishna.s.vasudevan (JIRA)" <ji...@apache.org>]

    [ https://issues.apache.org/jira/browse/HBASE-12790?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15899749#comment-15899749 ] 

ramkrishna.s.vasudevan edited comment on HBASE-12790 at 3/7/17 4:49 PM:
------------------------------------------------------------------------

I remember that setting attribute had 2 problems
1) The attribute has to be exposed to the client for all cases. So how to set the key for tht attribute as different scan can set different value for the same key.
2) The attribute has to be iterated at the RPC layer if the request is of scan type.
Overall the problem was that exposing this at the Client level in any form was the main concern.



was (Author: ram_krish):
I remember that setting attribute had 3problems
1) The attribute has to be exposed to the client for all cases. So how to set the key for tht attribute as different scan can set different value for the same key.
2) The attribute has to be iterated at the RPC layer if the request is of scan type.
Overall the problem was that exposing this at the Client level in any form was the main concern.


> Support fairness across parallelized scans
> ------------------------------------------
>
>                 Key: HBASE-12790
>                 URL: https://issues.apache.org/jira/browse/HBASE-12790
>             Project: HBase
>          Issue Type: New Feature
>            Reporter: James Taylor
>            Assignee: ramkrishna.s.vasudevan
>              Labels: Phoenix
>         Attachments: AbstractRoundRobinQueue.java, HBASE-12790_1.patch, HBASE-12790_5.patch, HBASE-12790_callwrapper.patch, HBASE-12790.patch, HBASE-12790_trunk_1.patch, PHOENIX_4.5.3-HBase-0.98-2317-SNAPSHOT.zip
>
>
> Some HBase clients parallelize the execution of a scan to reduce latency in getting back results. This can lead to starvation with a loaded cluster and interleaved scans, since the RPC queue will be ordered and processed on a FIFO basis. For example, if there are two clients, A & B that submit largish scans at the same time. Say each scan is broken down into 100 scans by the client (broken down into equal depth chunks along the row key), and the 100 scans of client A are queued first, followed immediately by the 100 scans of client B. In this case, client B will be starved out of getting any results back until the scans for client A complete.
> One solution to this is to use the attached AbstractRoundRobinQueue instead of the standard FIFO queue. The queue to be used could be (maybe it already is) configurable based on a new config parameter. Using this queue would require the client to have the same identifier for all of the 100 parallel scans that represent a single logical scan from the clients point of view. With this information, the round robin queue would pick off a task from the queue in a round robin fashion (instead of a strictly FIFO manner) to prevent starvation over interleaved parallelized scans.



--
This message was sent by Atlassian JIRA
(v6.3.15#6346)